Abstract
Facility location problem is one of the most important problems in the combinatorial optimization. The multi-level facility location problem and the facility location with capacities are important variants for the classical facility location problem. In this work, we consider the multilevel facility location problem with soft capacities in the uncertain scenario. The uncertainty setting means the location process is stochastic. We consider a two-stage model. The soft-capacities setting means each facility has multiple capacities by paying multiple opening cost. The multi-level setting means the client needs to connect to a path. We propose a bifactor \( (1/\alpha ,6/(1-2\alpha ) )\)-approximation algorithm for the stochastic multi-level facility location problem (SMLFLP), where \( \alpha \in (0,0.5) \) is a given constant. Then, we reduce the stochastic multi-level facility location problem with soft capacities to SMLFLP. The reduction implies a \( \left( 1/\alpha + 6/(1-2\alpha ) \right) \)-approximation algorithm. The ratio is 14.9282 when setting \( \alpha = 0.183 \).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afrashteh E, Alizadeh B, Baroughi F (2018) Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks. J Oper Res Soc China. https://doi.org/10.1007/s40305-018-0229-z
Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for \( k \)-median and facility location problem. SIAM J Comput 33:544–562
An HC, Singh M, Svensson O (2017) LP-based algorithms for capacitated facility location. SIAM J Comput 46:272–306
Ageev AA, Ye Y, Zhang J (2004) Improved combinatorial approximation algorithms for the \(k\)-level facility location problem. SIAM J Discret Math 18:207–217
Byrka J, Aardal K (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39:2212–2231
Bumb AF, Kern, W (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: Proceedings of APPROX, pp 55-63
Bryka J, Pensyl T, Rybicki B, Srinivasan A, Trinh K (2017) An improved approximation for \(k\)-median, and positive correlation in budgeted optimization. ACM Trans Algorithms 13(23):737–756
Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1–25
Gabor A, van Ommeren J (2010) A new approximation algorithm for the multilevel facility location problem. Discret Appl Math 158:453–460
Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50:795–824
Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and \(k\)-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48:274–296
Krishnaswamy R, Sviridenko M (2016) Inapproximability of the multilevel uncapacitated facility location problem. ACM Trans Algorithms 13:1–25
Li S (2011) A 1.488 -approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, Part II, pp 77–88
Li S (2019) On Facility Location with General Lower Bounds. In Proceedings of SODA, pp 2279–2290
Li S, Svensson O (2016) Approximating \(k\)-median via pseudo-approximation. SIAM J Comput 45:530–547
Li M, Xu D, Zhang D, Zhang T (2019) A streaming algorithm for k-means with approximate coreset. Asia-Pac J Oper Res 36:1950006
Han L, Xu D, Du D, Zhang D (2018) A local search approximation algorithm for the uniform capacitated k-facility location problem. J Comb Optim 35:409–423
Mahdian M, Ye Y, Zhang J (2003) A 2-approximation algorithm for the soft-capacitated facility location problem. In: Proceedings of APPROX, pp 149–162
Ravi R, Sinha A (2006) Hedging uncertainty: approximation algorithhms for stochastic optimization problems. Math Program 108:97–114
Srinivasan A (2007) Approximation algorithms for stochastic and risk-averse optimization. In: Proceedings of SODA. pp 1305–1313
Shmoys DB, Swamy C (2006) An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J ACM 53:978–1012
Shmoys DB, Tardös E, Aardal KI (1997) Approximation algorithms for facility location problems. In: Proceedings of STOC, pp 265–274
Sviridenko M (1998) Cited as personal communication in [8]
Wu W, Xu D (2017) An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities. Acta Mathematicae Applicatae Sinica, English Series 33:1015–1024
Ye, Y., Zhang, J (2005) An approximation algorithm for the dynamic facility location problem. In: Combinatorial optimization in communication networks. Kluwer Academic Publishers, pp 623–637
Zhang J (2006) Approximating the two-level facility location problem via a quasi-greedy approach. Math Program 108:159–176
Acknowledgements
Chenchen Wu is supported by Tianjin Municipal Education Commission (No. 2018KJ149). Donglei Du is supported by partially supported by the NSERC Grant (No. 283106), and NSFC Grants (Nos. 11771386 and 11728104). Yue Kang’s research is supported by NSFC Grant (No. 11871081).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This paper is dedicated to Professor Minyi Yue’s 100th Birthday.
Rights and permissions
About this article
Cite this article
Wu, C., Du, D. & Kang, Y. An approximation algorithm for stochastic multi-level facility location problem with soft capacities. J Comb Optim 44, 1680–1692 (2022). https://doi.org/10.1007/s10878-020-00538-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00538-8