An approximation algorithm for the dynamic facility location problem with submodular penalties
From MaRDI portal
Publication:403471
DOI10.1007/S10255-014-0277-ZzbMATH Open1305.90253OpenAlexW2036083900MaRDI QIDQ403471FDOQ403471
Chun-Yan Jiang, Gai-Di Li, Zhen Wang
Publication date: 29 August 2014
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-014-0277-z
Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Submodular functions and optimization.
- Algorithms for facility location problems with outliers. (Extended abstract)
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- A cross-monotonic cost sharing method for the facility location game with service installation costs
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- The \(k\)-level facility location game
- Title not available (Why is that?)
- Improved Combinatorial Algorithms for Facility Location Problems
- Title not available (Why is that?)
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A Dual-Based Procedure for Dynamic Facility Location
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- Approximation Algorithms for Metric Facility Location Problems
- Network design for information networks
- A cost-sharing method for an economic lot-sizing game
- Soft-capacitated facility location game
- Title not available (Why is that?)
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- Approximation algorithm for facility location with service installation costs
Cited In (6)
- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Dynamic facility location: The progressive p-median problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for the dynamic \(k\)-level facility location problems
This page was built for publication: An approximation algorithm for the dynamic facility location problem with submodular penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403471)