Approximation algorithms for the priority facility location problem with penalties
From MaRDI portal
Publication:905151
DOI10.1007/s11424-014-2157-2zbMath1330.49034OpenAlexW2144709496MaRDI QIDQ905151
Fengmin Wang, Chen-Chen Wu, Da-Chuan Xu
Publication date: 14 January 2016
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-2157-2
Related Items (1)
Cites Work
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A new approximation algorithm for the \(k\)-facility location problem
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation algorithms for the stochastic priority facility location problem
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation algorithms for the priority facility location problem with penalties
