An iterative algorithm for the multifacility minimax location problem with euclidean distances

DOI10.1002/nav.3800280214zbMath0462.90030OpenAlexW2048030940MaRDI QIDQ3912332

Christakis Charalambous

Publication date: 1981

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

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

zbMATH Keywords

iterative algorithmcomputational experienceEuclidean distancesmultifacility minimax location

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Related Items (1)

A heuristic algorithm for minimax sensor location in the plane

Cites Work

• Locating facilities in three‐dimensional space by convex programming

This page was built for publication: An iterative algorithm for the multifacility minimax location problem with euclidean distances