Solving multifacility location problems involving euclidean distances

DOI10.1002/nav.3800270408zbMath0447.90022OpenAlexW2037938321MaRDI QIDQ3893622

Paul H. Calamai, Christakis Charalambous

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270408

zbMATH Keywords

algorithmcomputational experienceEuclidean distancesmultifacility locationnecessary minimality conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (6)

Theorems of the alternative and duality ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ A note on optimality conditions for the Euclidean. Multifacility location problem ⋮ Selected bibliography on degeneracy ⋮ The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review

Cites Work

• Locating facilities in three‐dimensional space by convex programming

This page was built for publication: Solving multifacility location problems involving euclidean distances