EconPapers    
Economics at your fingertips  
 

Approximation algorithm for squared metric two-stage stochastic facility location problem

Jin Zhang (), Min Li (), Yishui Wang (), Chenchen Wu () and Dachuan Xu ()
Additional contact information
Jin Zhang: Beijing University of Technology
Min Li: Shandong Normal University
Yishui Wang: Chinese Academy of Sciences
Chenchen Wu: Tianjin University of Technology
Dachuan Xu: Beijing University of Technology

Journal of Combinatorial Optimization, 2019, vol. 38, issue 2, No 16, 618-634

Abstract: Abstract In this paper, we consider a variant of the classical uncapacitated facility location problem, so-called squared metric two-stage stochastic facility location problem (SM-2-SFLP) which can treat the uncertainty of the set of clients and facility costs. We assume that the connection cost is squared metric, a variant of the metric case which is widely researched. We give a new 0–1 integer linear programming for SM-2-SFLP. Based on the new formulation, we apply two known algorithms to SM-2-SFLP, and analyze the approximation ratio and per-scenario bound respectively.

Keywords: Stochastic facility location problem; Squared metric; Approximation algorithm; Per-scenario bound (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00404-2 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:38:y:2019:i:2:d:10.1007_s10878-019-00404-2

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

DOI: 10.1007/s10878-019-00404-2

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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:38:y:2019:i:2:d:10.1007_s10878-019-00404-2