Approximation Algorithms for the Robust Facility Location Problem with Penalties
From MaRDI portal
Recommendations
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithms for the priority facility location problem with penalties
- Approximate robust optimization for the connected facility location problem
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Approximation algorithm for the fault-tolerant facility placement problem with penalties
- An approximation algorithm for the two-stage distributionally robust facility location problem
- scientific article; zbMATH DE number 5811147
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
Cites work
- scientific article; zbMATH DE number 4202014 (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 2086926 (Why is no real title available?)
- scientific article; zbMATH DE number 5064928 (Why is no real title available?)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A new approximation algorithm for the k-facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Algorithms for facility location problems with outliers. (Extended abstract)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- 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 the facility location problems with linear/submodular penalty
Cited in
(7)- Uniform capacitated facility location with outliers/penalties
- scientific article; zbMATH DE number 5811147 (Why is no real title available?)
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Robust solutions to Euclidean facility location problems with uncertain data
- Approximation algorithms for the robust facility leasing problem
- Approximation algorithms for the priority facility location problem with penalties
- On the power of static assignment policies for robust facility location problems
This page was built for publication: Approximation Algorithms for the Robust Facility Location Problem with Penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942466)
