An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
From MaRDI portal
Publication:1690580
DOI10.1007/s10255-017-0714-xzbMath1386.90132OpenAlexW2770228565MaRDI QIDQ1690580
Publication date: 19 January 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-017-0714-x
Related Items (5)
The facility location problem with maximum distance constraint ⋮ Approximation algorithms for the dynamic \(k\)-level facility location problems ⋮ Approximation algorithms for the robust/soft-capacitated 2-level facility location problems ⋮ 2-level station location for bike sharing ⋮ An approximation algorithm for stochastic multi-level facility location problem with soft capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approximation algorithm for the multilevel facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Improved approximation algorithms for multilevel facility location problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Local Search Heuristics for k-Median and Facility Location Problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
This page was built for publication: An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities
