Solving multifacility location problems involving euclidean distances

DOI10.1002/NAV.3800270408MaRDI QIDQ3893622zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Locating facilities in three‐dimensional space by convex programming

Cited in

(6)

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

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

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