Finding efficient solutions for rectilinear distance location problems efficiently

DOI10.1016/0377-2217(81)90197-1zbMath0451.90037OpenAlexW2069104637MaRDI QIDQ1148204

L. G. Chalmet, Antoon W. J. Kolen, Richard L. Francis

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90197-1

zbMATH Keywords

computational complexityefficient solutionslogisticsplanar facility locationgeometrical analysisconstruction of all efficient locationsrectilinear distance locationrow algorithmsimple arrow algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (28)

Kolmogorov-conditions for vectorial approximation problems ⋮ A fast algorithm for the rectilinear distance location problem ⋮ On duality in the vectorial control-approximation problem ⋮ Unnamed Item ⋮ Mixed planar/network facility location problems ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ The multicriteria big cube small cube method ⋮ A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem ⋮ A new algorithm for solving planar multiobjective location problems involving the Manhattan norm ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ Determination of efficient solutions for point-objective locational decision problems ⋮ Dualität und algorithmische anwendung beim vektoriellen standortproblem ⋮ On locating new facilities in a competitive environment ⋮ Locational analysis ⋮ Hull properties in location problems ⋮ Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem ⋮ A rounding algorithm for approximating minimum Manhattan networks ⋮ Duality in vectorial control approximation problems with inequality restrictions ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS ⋮ Efficiency in integral facility design problems ⋮ Multicriteria planar location problems ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ A special class of extended multicriteria location problems ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ Analysis of multicriteria decision aid in Europe

Cites Work

• Proper efficiency and the theory of vector maximization
• A sorting problem and its complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding efficient solutions for rectilinear distance location problems efficiently