Indexed by:
Abstract:
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. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Reprint Author's Address:
Email:
Source :
OPERATIONS RESEARCH LETTERS
ISSN: 0167-6377
Year: 2010
Issue: 5
Volume: 38
Page: 386-389
1 . 1 0 0
JCR@2022
ESI Discipline: ENGINEERING;
JCR Journal Grade:3
CAS Journal Grade:4
Cited Count:
WoS CC Cited Count: 10
SCOPUS Cited Count: 11
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 7
Affiliated Colleges: