Approximating soft-capacitated facility location problem with uncertainty

Shuxin Cai (), Wenguo Yang () and Yaohua Tang
Additional contact information
Shuxin Cai: Graduate University of Chinese Academy of Sciences
Wenguo Yang: Graduate University of Chinese Academy of Sciences
Yaohua Tang: Graduate University of Chinese Academy of Sciences

Journal of Combinatorial Optimization, 2014, vol. 28, issue 2, No 11, 496-504

Abstract: Abstract In this paper we devise the stochastic and robust approaches to study the soft-capacitated facility location problem with uncertainty. We first present a new stochastic soft-capacitated model called The 2-Stage Soft Capacitated Facility Location Problem and solve it via an approximation algorithm by reducing it to linear-cost version of 2-stage facility location problem and dynamic facility location problem. We then present a novel robust model of soft-capacitated facility location, The Robust Soft Capacitated Facility Location Problem. To solve it, we improve the approximation algorithm proposed by Byrka et al. (LP-rounding algorithms for facility-location problems. CoRR, 2010a) for RFTFL and then treat it similarly as in the stochastic case. The improvement results in an approximation factor of $$\alpha + 4$$ for the robust fault-tolerant facility location problem, which is best so far.

Keywords: Facility location; Approximation algorithm; 2-Stage; Robust; Stochastic; Soft-capacitated (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9573-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:2:d:10.1007_s10878-012-9573-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9573-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().