Facility location with rectilinear tour distances
| dc.contributor.author | Drezner, Zvi | en_US |
| dc.contributor.author | Wesolowsky, George O. | en_US |
| dc.contributor.author | Steiner, George | en_US |
| dc.contributor.author | McMaster University, Faculty of Business | en_US |
| dc.date.accessioned | 2014-06-17T20:40:03Z | |
| dc.date.available | 2014-06-17T20:40:03Z | |
| dc.date.created | 2013-12-23 | en_US |
| dc.date.issued | 1984-03 | en_US |
| dc.description | <p>20, 7 leaves ; ; Cover title.;Includes bibliographical references (leaf 20).</p> | en_US |
| dc.description.abstract | <p>This problem concerns the location of a facility among n points where the points are serviced by "tours" take n from the facility. Tours include m points at a time and each group of m points ma y become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. An exact solution procedure is provided for m < 3 and a bounded heuristic algorithm is suggested when some tours have 4 or more points. It is shown that in the latter case the objective function becomes multimodal.</p> | en_US |
| dc.identifier.other | dsb/120 | en_US |
| dc.identifier.other | 1119 | en_US |
| dc.identifier.other | 4944143 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/5459 | |
| dc.relation.ispartofseries | Research and working paper series (McMaster University. Faculty of Business) | en_US |
| dc.relation.ispartofseries | no. 214 | en_US |
| dc.subject.lcc | Industrial location > Mathematical models | en_US |
| dc.title | Facility location with rectilinear tour distances | en_US |
| dc.type | article | en_US |
Files
Original bundle
1 - 1 of 1