A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
From MaRDI portal
Publication:5169466
DOI10.1080/02331934.2013.840626zbMath1311.90066MaRDI QIDQ5169466
Dong-lei Du, Chen-Chen Wu, Da-Chuan Xu
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.840626
Cites Work
- An approximation algorithm for the \(k\)-level stochastic facility location problem
- Approximation algorithms for supply chain planning and logistics problems with market choice
- 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 combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
- A 1.488 approximation algorithm for the uncapacitated 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
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation Algorithms for Metric Facility Location Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- A primal-dual -approximation algorithm for the stochastic facility location problem with submodular penalties
- Stochastic Transportation-Inventory Network Design Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
