Approximation algorithms for the priority facility location problem with submodular penalties
From MaRDI portal
Publication:3462909
Recommendations
- Approximation algorithms for the priority facility location problem with penalties
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Facility location problems with submodular penalties and stochastic demands
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
Cited in
(11)- An approximation algorithm for the \(k\)-level facility location problem with submodular penalties
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- An approximation algorithm for the warehouse-retailer network design problem with submodular penalties
- Facility location problems with submodular penalties and stochastic demands
- Approximation algorithms for the priority facility location problem with penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalty
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- Algorithm for \(k\)-product facility location problem with submodular penalties
- scientific article; zbMATH DE number 1947045 (Why is no real title available?)
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
This page was built for publication: Approximation algorithms for the priority 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 Q3462909)