Inapproximability of the multi-level uncapacitated facility location problem
From MaRDI portal
Recommendations
- Inapproximability of the multilevel uncapacitated facility location problem
- Improved approximation algorithms for multilevel facility location problems
- scientific article; zbMATH DE number 1947043
- An approximation algorithm for the k-level capacitated facility location problem
- A General k-Level Uncapacitated Facility Location Problem
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 2159272 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- scientific article; zbMATH DE number 1833402 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A Dual-Based Procedure for Dynamic Facility Location
- A Greedy Heuristic for the Set-Covering Problem
- A Plant and Warehouse Location Problem
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A new approximation algorithm for the multilevel facility location problem
- A threshold of ln n for approximating set cover
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation algorithms for combinatorial problems
- Discrete and fractional programming techniques for location models
- Facility location with hierarchical facility costs
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved approximation algorithms for multilevel facility location problems
- On the Two-Level Uncapacitated Facility Location Problem
- On the ratio of optimal integral and fractional covers
- The simple plant location problem: Survey and synthesis
Cited in
(12)- Robust network function virtualization
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
- An approximation algorithm for the k-level facility location problem with outliers
- Inapproximability of the multilevel uncapacitated facility location problem
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
- An improved approximation algorithm for the k-level facility location problem with soft capacities
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- A note on the maximization version of the multi-level facility location problem
- Approximation algorithms for \(k\)-level stochastic facility location problems
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
This page was built for publication: Inapproximability of the multi-level uncapacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743432)
