An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters , Volume 38 - Issue 5 p. 386- 389
We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.
|Approximation algorithm, Facility location, Randomized rounding|
|ERIM Article Series (EAS)|
|Operations Research Letters|
|Organisation||Erasmus Research Institute of Management|
Wang, Z, Du, D, Gabor, A.F, & Xu, D. (2010). An approximation algorithm for the k-level stochastic facility location problem. Operations Research Letters, 38(5), 386–389. doi:10.1016/j.orl.2010.04.010