An approximation algorithm for the k-level stochastic facility location problem
September 2010
Article
volume 38, issue 5 pp 386-389.
This publication is part of collection
| Related Files |
|---|
|
Redirect to publisher's version
(publisher's version.url.txt, 43 bytes) |
Repository contains one additional file which is not publicly available
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.
Keywords
