LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
From MaRDI portal
Publication:2295313
DOI10.1016/j.apm.2017.12.009zbMath1480.90164OpenAlexW2772497726MaRDI QIDQ2295313
Sai Ji, Yi-Jing Wang, Da-Chuan Xu, Dong-lei Du
Publication date: 12 February 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2017.12.009
Integer programming (90C10) Stochastic programming (90C15) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- An approximation algorithm for the fault tolerant metric facility location problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- An improved per-scenario bound for the two-stage stochastic facility location problem
- A new approximation algorithm for the \(k\)-facility location problem
- 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
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem