Minisum location with closest Euclidean distances
From MaRDI portal
Publication:1872032
DOI10.1023/A:1020901719463zbMath1040.90020MaRDI QIDQ1872032
Publication date: 4 May 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Continuous location (90B85)
Related Items (16)
Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ Heuristics for a continuous multi-facility location problem with demand regions ⋮ Minisum location problem with farthest Euclidean distances ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Continuous location model of a rectangular barrier facility ⋮ On the structure of the solution set for the single facility location problem with average distances ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ A minisum location problem with regional demand considering farthest Euclidean distances ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
This page was built for publication: Minisum location with closest Euclidean distances
