The approximation gap for the metric facility location problem is not yet closed
From MaRDI portal
Publication:2467481
DOI10.1016/J.ORL.2006.03.017zbMATH Open1176.90368OpenAlexW2035749132MaRDI QIDQ2467481FDOQ2467481
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
Recommendations
- Approximation Algorithms for Metric Facility Location Problems
- scientific article; zbMATH DE number 1947060
- scientific article; zbMATH DE number 2086926
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- An approximation algorithm for the fault tolerant metric facility location problem
- scientific article; zbMATH DE number 1670540
- Approximation algorithms for the squared metric \(k\)-level facility location problem
- scientific article; zbMATH DE number 1559542
- An improved approximation algorithm for squared metric \(k\)-facility location
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem
Cites Work
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- A new greedy approach for facility location problems
- Title not available (Why is that?)
- Heuristics for the fixed cost median problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Cited In (3)
This page was built for publication: The approximation gap for the metric facility location problem is not yet closed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467481)
