An approximation algorithm for the k-level stochastic facility location problem

AF Gabor; Zhen Wang; D Du; D Xu

doi:10.1016/j.orl.2010.04.010

An approximation algorithm for the k-level stochastic facility location problem

AF Gabor, Zhen Wang, D Du, D Xu

Econometrics

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

Abstract

We consider the kk-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.

Original language	English
Pages (from-to)	386-389
Number of pages	3
Journal	Operations Research Letters
Volume	38
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2010.04.010
Publication status	Published - 2010

Access to Document

10.1016/j.orl.2010.04.010

Cite this

@article{79c9582c00b94caaa0e90b88f636e3fe,

title = "An approximation algorithm for the k-level stochastic facility location problem",

abstract = "We consider the kk-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.",

author = "AF Gabor and Zhen Wang and D Du and D Xu",

year = "2010",

doi = "10.1016/j.orl.2010.04.010",

language = "English",

volume = "38",

pages = "386--389",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - An approximation algorithm for the k-level stochastic facility location problem

AU - Gabor, AF

AU - Wang, Zhen

AU - Du, D

AU - Xu, D

PY - 2010

Y1 - 2010

N2 - We consider the kk-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.

AB - We consider the kk-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.

U2 - 10.1016/j.orl.2010.04.010

DO - 10.1016/j.orl.2010.04.010

M3 - Article

SN - 0167-6377

VL - 38

SP - 386

EP - 389

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

An approximation algorithm for the k-level stochastic facility location problem

Abstract

Access to Document

Fingerprint

Cite this