An approximation algorithm for the \(k\)-level stochastic facility location problem
From MaRDI portal
Publication:613331
DOI10.1016/j.orl.2010.04.010zbMath1202.90178OpenAlexW2011226162MaRDI QIDQ613331
Adriana F. Gabor, Zhen Wang, Da-Chuan Xu, Dong-lei Du
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.010
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
Approximation algorithms for \(k\)-level stochastic facility location problems ⋮ A primal-dual approximation algorithm for stochastic facility location problem with service installation costs ⋮ Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach ⋮ Multi-level facility location problems ⋮ A per-scenario bound for the two-stage stochastic facility location problem with linear penalty ⋮ Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approximation algorithm for the multilevel facility location problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- A new approximation algorithm for the \(k\)-facility location problem
- Integrated location and two-echelon inventory network design under uncertainty
- 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
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Stochastic Transportation-Inventory Network Design Problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: An approximation algorithm for the \(k\)-level stochastic facility location problem
