An algorithm for the minimax Weber problem

DOI10.1016/0377-2217(81)90200-9zbMath0452.90024OpenAlexW1985025885WikidataQ29395444 ScholiaQ29395444MaRDI QIDQ1148779

Soren Kruse Jacobsen

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)90200-9

zbMATH Keywords

algorithmEuclidean planeimplementationcomputational experienceminimax locationlogisticsminimax Weber problemproof of convergenceFORTRANmethod of feasible directionsweighted absolute center

Mathematics Subject Classification ID

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

Related Items (6)

Solving general continuous single facility location problems by cutting planes ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Continuous Center Problems ⋮ The multi-facility min-max Weber problem ⋮ Lower subdifferentiable functions and their minimization by cutting planes ⋮ Localization in single facility location

Cites Work

• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
• An approach to nonlinear programming
• An Efficient Method to Solve the Minimax Problem Directly
• Unnamed Item

This page was built for publication: An algorithm for the minimax Weber problem