Finding efficient solutions for rectilinear distance location problems efficiently

DOI10.1016/0377-2217(81)90197-1MaRDI QIDQ1148204zbMATH OpenOpenAlexFDO

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

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 complexitylogisticsefficient solutionsplanar facility locationgeometrical analysisconstruction of all efficient locationsrectilinear distance locationrow algorithmsimple arrow algorithm

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• scientific article; zbMATH DE number 1241849 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A sorting problem and its complexity
• Proper efficiency and the theory of vector maximization

Cited in

(28)

• Multiobjective control approximation problems: duality and optimality.
• A characterization of efficient points in constrained location problems with regional demand
• Greedy construction of 2-approximate minimum Manhattan networks
• Bicriteria and restricted 2-facility Weber problems
• On locating new facilities in a competitive environment
• On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
• Meilleure approximation en norme vectorielle et théorie de la localisation
• Dualität und algorithmische anwendung beim vektoriellen standortproblem
• On duality in the vectorial control-approximation problem
• The multicriteria big cube small cube method
• Mixed planar/network facility location problems
• Efficiency in integral facility design problems
• A rounding algorithm for approximating minimum Manhattan networks
• Kolmogorov-conditions for vectorial approximation problems
• scientific article; zbMATH DE number 1417899 (Why is no real title available?)
• Multicriteria planar location problems
• Relationships between constrained and unconstrained multi-objective optimization and application in location theory
• A special class of extended multicriteria location problems
• Analysis of multicriteria decision aid in Europe
• Locational analysis
• Determination of efficient solutions for point-objective locational decision problems
• Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
• Hull properties in location problems
• A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
• A fast algorithm for the rectilinear distance location problem
• Pareto envelopes in simple polygons
• Duality in vectorial control approximation problems with inequality restrictions
• A new algorithm for solving planar multiobjective location problems involving the Manhattan norm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148204)