The approximation gap for the metric facility location problem is not yet closed
From MaRDI portal
Publication:2467481
DOI10.1016/j.orl.2006.03.017zbMath1176.90368OpenAlexW2035749132MaRDI QIDQ2467481
Publication date: 21 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.03.017
Related Items (3)
Approximation algorithm for uniform bounded facility location problem ⋮ On the Location and p-Median Polytopes ⋮ Approximation Algorithm for the Uniform Bounded Facility Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new greedy approach for facility location problems
- Heuristics for the fixed cost median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Greedy Strikes Back: Improved Facility Location Algorithms
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: The approximation gap for the metric facility location problem is not yet closed