{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:20:33Z","timestamp":1756311633717,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T00:00:00Z","timestamp":1504483200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11501412","11371001"],"award-info":[{"award-number":["11501412","11371001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Higher Educational Science and Technology Program of Shandong Province","award":["J15LN23"],"award-info":[{"award-number":["J15LN23"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61672323"],"award-info":[{"award-number":["61672323"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10898-017-0566-1","type":"journal-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T09:58:53Z","timestamp":1504519133000},"page":"207-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximation algorithms for the robust\/soft-capacitated 2-level facility location problems"],"prefix":"10.1007","volume":"70","author":[{"given":"Chenchen","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for $$k$$ k -median and facility location problems. In: Proceedings of STOC, pp. 21\u201329 (2001)","key":"566_CR1","DOI":"10.1145\/380752.380755"},{"key":"566_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"AA Ageev","year":"2004","unstructured":"Ageev, A.A., Ye, Y., Zhang, J.: Improved combinatorial approximation algorithms for the $$k$$ k -level facility location problem. SIAM J. Discrete Math. 18, 207\u2013217 (2004)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Bumb, A.F., Kern, W.A.: Simple dual ascent algorithm for the multilevel facility location problem. In: Proceedings of APPROX-RANDOM, pp. 55\u201362 (2001)","key":"566_CR3","DOI":"10.1007\/3-540-44666-4_10"},{"doi-asserted-by":"crossref","unstructured":"Byrka, J., Rybicki, B.: Improved LP-rounding approximation algorithm for $$k$$ k -level uncapacitated facility location. In: Proceedings of ICALP, pp. 157\u2013169 (2012)","key":"566_CR4","DOI":"10.1007\/978-3-642-31594-7_14"},{"unstructured":"Charikar, M., Khuller, S., Mount, M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp. 642\u2013651 (2001)","key":"566_CR5"},{"doi-asserted-by":"crossref","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the capacitated facility location problem. In: Proceedings of SODA, pp. 875\u2013876 (1999)","key":"566_CR6","DOI":"10.1007\/3-540-48777-8_8"},{"key":"566_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.dam.2009.11.007","volume":"158","author":"A Gabor","year":"2010","unstructured":"Gabor, A., van Ommeren, J.: A new approximation algorithm for the multilevel facility location problem. Discrete Appl. Math. 158, 453\u2013460 (2010)","journal-title":"Discrete Appl. Math."},{"key":"566_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and $$k$$ k -median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"566_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Approximation algorithms for facility location via dualfitting with factor-revealing LP. J. ACM 50, 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"566_CR10","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1057\/jors.1977.104","volume":"28","author":"L Kaufman","year":"1977","unstructured":"Kaufman, L., Eede, M.V., Hansen, P.: A plant and warehouse location problem. Oper. Res. Q. 28, 547\u2013557 (1977)","journal-title":"Oper. Res. Q."},{"doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Sviridenko, M.: Inapproximability of the multi-level uncapacitated facility location problem. In: Proceedings of SODA, pp. 718\u2013734 (2012)","key":"566_CR11","DOI":"10.1137\/1.9781611973099.59"},{"key":"566_CR12","first-page":"1","volume":"57","author":"G Li","year":"2014","unstructured":"Li, G., Du, D., Xu, D., Yang, R.: A cost-sharing method for the multi-level economic lot-sizing game. Sci. China Inf. Sci. 57, 1\u20139 (2014)","journal-title":"Sci. China Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: A $$2$$ 2 -approximation algorithm for the soft-capacitated facility location problem. In: Proceedings of APPROX, pp. 129C140 (2003)","key":"566_CR13","DOI":"10.1007\/978-3-540-45198-3_12"},{"key":"566_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32, 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"566_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0377-2217(84)90258-3","volume":"18","author":"D Tcha","year":"1984","unstructured":"Tcha, D., Lee, B.: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem. Eur. J. Oper. Res. 18, 35\u201343 (1984)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Wu, C., Xu, D.: Improved approximation algorithms for the $$k$$ k -level facility location problem with soft capacities. Accepted by Acta Mathematicae Applicatae Sinica","key":"566_CR16"},{"key":"566_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2014.09.045","volume":"562","author":"C Wu","year":"2015","unstructured":"Wu, C., Du, D., Xu, D.: Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach. Theor. Comput. Sci. 562, 213\u2013226 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"566_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11425-014-4933-9","volume":"58","author":"C Wu","year":"2015","unstructured":"Wu, C., Du, D., Xu, D.: An improved per-scenario bound for the two-stage stochastic facility location problem. Sci. China Math. 58, 213\u2013220 (2015)","journal-title":"Sci. China Math."},{"key":"566_CR19","first-page":"1102","volume":"28","author":"F Wang","year":"2016","unstructured":"Wang, F., Xu, D., Wu, C.: Combinatorial approximation algorithms for the robust facility location problem with penalties. J. Glob. Optim. 28, 1102\u20131114 (2016)","journal-title":"J. Glob. Optim."},{"key":"566_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D Xu","year":"2006","unstructured":"Xu, D., Du, D.: The $$k$$ k -level facility location game. Oper. Res. Lett. 34, 421\u2013426 (2006)","journal-title":"Oper. Res. Lett."},{"key":"566_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J Zhang","year":"2006","unstructured":"Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. Math. Program. 108, 159\u2013176 (2006)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0566-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0566-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0566-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T04:31:50Z","timestamp":1659414710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0566-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0566-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,9,4]]}}}