Approximation algorithms for the priority facility location problem with penalties
From MaRDI portal
Publication:905151
DOI10.1007/S11424-014-2157-2zbMATH Open1330.49034OpenAlexW2144709496MaRDI QIDQ905151FDOQ905151
Recommendations
- Approximation algorithms for the priority facility location problem with submodular penalties
- Approximation algorithms for the stochastic priority facility location problem
- scientific article; zbMATH DE number 5811147
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- scientific article; zbMATH DE number 1670526
- An improved approximation algorithm for uncapacitated facility location problem with penalties
Cites work
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (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 approximation algorithm for the \(k\)-level capacitated facility location problem
- 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
- Approximation algorithms for the stochastic priority facility location problem
- Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
- Improved Combinatorial Algorithms for Facility Location Problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Multicommodity facility location
- Network design for information networks
Cited in
(9)- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
- Approximation algorithm for resource allocation problems with time dependent penalties
- The power of priority algorithms for facility location and set cover
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- Title not available (Why is no real title available?)
- Approximation algorithms for the priority facility location problem with submodular penalties
This page was built for publication: Approximation algorithms for the priority facility location problem with penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905151)
