An algorithm for the solution of a location problem with metric constraints
- 1 December 1974
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (4) , 625-636
- https://doi.org/10.1002/nav.3800210406
Abstract
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed.Keywords
This publication has 7 references indexed in Scilit:
- Location Theory, Dominance, and ConvexityOperations Research, 1973
- Optimal location under time or distance constraintsPapers in Regional Science, 1972
- Properties of a multifacility location problem involving euclidian distancesNaval Research Logistics Quarterly, 1972
- The Location of Emergency Service FacilitiesOperations Research, 1971
- Location of facilities with rectangular distances among point and area destinationsNaval Research Logistics Quarterly, 1971
- Locating facilities in three‐dimensional space by convex programmingNaval Research Logistics Quarterly, 1969
- The Siting of Fire StationsJournal of the Operational Research Society, 1968