Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
From MaRDI portal
Publication:3452561
DOI10.1007/978-3-319-19647-3_15zbMath1408.90165OpenAlexW1151318865MaRDI QIDQ3452561
Gai-Di Li, Da-Chuan Xu, Chen-Chen Wu, Dong-lei Du
Publication date: 12 November 2015
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_15
Related Items (4)
A cost-sharing scheme for the \(k\)-level facility location game with penalties ⋮ A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties ⋮ Approximation algorithms for the dynamic \(k\)-level facility location problems ⋮ Multi-level facility location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cost-sharing method for the multi-level economic lot-sizing game
- A new approximation algorithm for the multilevel facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- Submodular functions and optimization.
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
This page was built for publication: Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
