An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
From MaRDI portal
Publication:1694399
DOI10.1007/s10589-017-9935-4zbMath1392.90095OpenAlexW2743430153WikidataQ57338940 ScholiaQ57338940MaRDI QIDQ1694399
Alexander Grigoriev, Andrej Winokurow, André Berger
Publication date: 1 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/10.1007/s10589-017-9935-4
Related Items (4)
Facility location problems on graphs with non-convex neighborhoods ⋮ The extensive 1-median problem with radius on networks ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
Cites Work
- Heuristics for a continuous multi-facility location problem with demand regions
- A new polynomial-time algorithm for linear programming
- Algorithmic results for ordered median problems
- Minisum location with closest Euclidean distances
- Multicriteria planar ordered median problems
- Location Theory
- Linear-time approximation schemes for clustering problems in any dimensions
- Geometric median in nearly linear time
- An Approach to Location Models Involving Sets as Existing Facilities
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions