Solution of minisum and minimax location–allocation problems with Euclidean distances
- 1 September 1983
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 30 (3) , 449-459
- https://doi.org/10.1002/nav.3800300309
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Local Optima Avoidance in Depot LocationJournal of the Operational Research Society, 1981
- An efficient algorithm for the location-allocation problem with rectangular regionsNaval Research Logistics Quarterly, 1981
- BOUNDS IN THE LOCATION‐ALLOCATION PROBLEMJournal of Regional Science, 1981
- Toward More Realistic Allocation in Location—Allocation Models: An Interaction ApproachEnvironment and Planning A: Economy and Space, 1978
- A New Method for the Multifacility Minimax Location ProblemJournal of the Operational Research Society, 1978
- A computation procedure for the exact solution of location‐allocation problems with rectangular distancesNaval Research Logistics Quarterly, 1975
- AN EFFICIENT ALGORITHM FOR SOLVING THE TWO CENTER LOCATION‐ALLOCATION PROBLEMJournal of Regional Science, 1975
- Location‐Allocation Systems: A ReviewGeographical Analysis, 1970
- SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS†Journal of Regional Science, 1967
- AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICSJournal of Regional Science, 1962