An algorithm for the minimax Weber problem

DOI10.1016/0377-2217(81)90200-9MaRDI QIDQ1148779zbMATH OpenOpenAlexWikidataFDO

Authors 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

algorithmlogisticsimplementationminimax Weber problemproof of convergenceminimax locationEuclidean planecomputational experienceFORTRANmethod of feasible directionsweighted absolute center

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• An Efficient Method to Solve the Minimax Problem Directly
• An approach to nonlinear programming
• Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria

Cited in

(7)

• Continuous center problems
• Lower subdifferentiable functions and their minimization by cutting planes
• A new algorithm for the minimax location problem with the closest distance
• Solving general continuous single facility location problems by cutting planes
• The weighted Euclidean one-center problem in \(\mathbb{R}^n\)
• Localization in single facility location
• The multi-facility min-max Weber problem

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

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