LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
DOI10.1016/J.APM.2017.12.009zbMATH Open1480.90164OpenAlexW2772497726MaRDI QIDQ2295313FDOQ2295313
Authors: Sai Ji, Dachuan Xu, Donglei Du, Yi-Jing Wang 
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
Recommendations
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- LP-rounding algorithms for the fault-tolerant facility placement problem
- LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
- A primal-dual approximation algorithm for stochastic fault-tolerant facility location problems
- An approximation algorithm for the stochastic fault-tolerant facility placement problem
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- An approximation algorithm for the fault tolerant metric facility location problem
- scientific article; zbMATH DE number 1670540
Stochastic programming (90C15) Approximation algorithms (68W25) Integer programming (90C10) 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
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximating the two-level facility location problem via a quasi-greedy approach
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A new approximation algorithm for the \(k\)-facility location problem
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Title not available (Why is that?)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Title not available (Why is that?)
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation Algorithms for Metric Facility Location Problems
- A constant factor approximation algorithm for the fault-tolerant facility location problem
- An approximation algorithm for the fault tolerant metric facility location problem
- A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- An improved per-scenario bound for the two-stage stochastic facility location problem
Cited In (2)
This page was built for publication: LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295313)
