{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:04:42Z","timestamp":1758272682487,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T00:00:00Z","timestamp":1611014400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T00:00:00Z","timestamp":1611014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081","11501412"],"award-info":[{"award-number":["11871081","11501412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11590-021-01701-8","type":"journal-article","created":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T15:03:10Z","timestamp":1611068590000},"page":"2053-2065","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An approximation algorithm for the k-level facility location problem with outliers"],"prefix":"10.1007","volume":"15","author":[{"given":"Lu","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dandan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6742-8816","authenticated-orcid":false,"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,19]]},"reference":[{"key":"1701_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"KI Aardal","year":"1999","unstructured":"Aardal, K.I., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the $$k$$-level uncapacitated facility location problem. Inf. Process. Lett. 72, 161\u2013167 (1999)","journal-title":"Inf. Process. Lett."},{"key":"1701_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for $$k$$-median and facility location problems. SIAM J. Comput. 33, 544\u2013562 (2004)","journal-title":"SIAM J. Comput."},{"key":"1701_CR3","doi-asserted-by":"crossref","unstructured":"Asadi, M., Niknafs, A., Ghodsi, M.: An approximation algorithm for the $$k$$-level uncapacitated facility location problem with penalties. In: Proceedings of the 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, pp. 41\u201349 (2008)","DOI":"10.1007\/978-3-540-89985-3_6"},{"key":"1701_CR4","doi-asserted-by":"crossref","unstructured":"Bumb, A., Kern, W.: A simple dual ascent algorithm for the multilevel facility location problem. In: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 55\u201362 (2001)","DOI":"10.1007\/3-540-44666-4_10"},{"key":"1701_CR5","unstructured":"Bumb, A.: Approximation Algorithms for Facility Location Problem. Ph.D. Thesis, University of Twente (2002)"},{"key":"1701_CR6","doi-asserted-by":"publisher","first-page":"2212","DOI":"10.1137\/070708901","volume":"39","author":"J Byrka","year":"2010","unstructured":"Byrka, J., Aardal, K.I.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39, 2212\u20132231 (2010)","journal-title":"SIAM J. Comput."},{"key":"1701_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00224-014-9575-3","volume":"58","author":"J Byrka","year":"2016","unstructured":"Byrka, J., Li, S., Rybicki, B.: Improved approximation algorithm for $$k$$-level uncapacitated facility location problem (with penalties). Theory Comput. Syst. 58, 19\u201344 (2016)","journal-title":"Theory Comput. Syst."},{"key":"1701_CR8","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S0097539701398594","volume":"34","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34, 803\u2013824 (2005)","journal-title":"SIAM J. Comput."},{"key":"1701_CR9","unstructured":"Charikar, M., Khuller, S., Mount, DM., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 642\u2013651 (2001)"},{"key":"1701_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2003","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1\u201325 (2003)","journal-title":"SIAM J. Comput."},{"key":"1701_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31, 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"1701_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"AA Kuehn","year":"1963","unstructured":"Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Manag. Sci. 9, 643\u2013666 (1963)","journal-title":"Manag. Sci."},{"key":"1701_CR13","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, E., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50, 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"1701_CR14","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$$-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274\u2013296 (2001)","journal-title":"J. ACM"},{"key":"1701_CR15","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Sviridenko, M.: Inapproximability of the multi-level uncapacitated facility location problem. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 718\u2013734 (2012)","DOI":"10.1137\/1.9781611973099.59"},{"key":"1701_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222, 45\u201358 (2013)","journal-title":"Inf. Comput."},{"key":"1701_CR17","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y Li","year":"2015","unstructured":"Li, Y., Du, D., Xiu, N., Xu, D.: Improved approximation algorithms for the facility location problems with linear\/submodular penalties. Algorithmica 73, 460\u2013482 (2015)","journal-title":"Algorithmica"},{"key":"1701_CR18","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 229\u2013242 (2002)","DOI":"10.1007\/3-540-45753-4_20"},{"key":"1701_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/mnsc.11.2.213","volume":"11","author":"AS Manne","year":"1964","unstructured":"Manne, A.S.: Plant location under economies-of-scale-decentralization and computation. Manag. Sci. 11, 213\u2013235 (1964)","journal-title":"Manag. Sci."},{"key":"1701_CR20","doi-asserted-by":"crossref","unstructured":"Shmoys, DB., Tardos, $$\\acute{{\\rm E}}$$., Aardal, KI.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"1701_CR21","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.1040.0140","volume":"53","author":"J Shu","year":"2005","unstructured":"Shu, J., Teo, C.P., Shen, Z.J.M.: Stochastic transportation-inventory network design problem. Oper. Res. 53, 48\u201360 (2005)","journal-title":"Oper. Res."},{"key":"1701_CR22","doi-asserted-by":"publisher","first-page":"631","DOI":"10.2307\/1235442","volume":"45","author":"JF Stollsteimer","year":"1963","unstructured":"Stollsteimer, J.F.: A working model for plant numbers and locations. J. Farm Econ. 45, 631\u2013645 (1963)","journal-title":"J. Farm Econ."},{"key":"1701_CR23","doi-asserted-by":"crossref","unstructured":"Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, pp. 240\u2013257 (2002)","DOI":"10.1007\/3-540-47867-1_18"},{"key":"1701_CR24","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1287\/opre.1030.0096","volume":"52","author":"CP Teo","year":"2004","unstructured":"Teo, C.P., Shu, J.: Warehouse-retailer network design problem. Oper. Res. 52, 396\u2013408 (2004)","journal-title":"Oper. Res."},{"key":"1701_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10898-017-0566-1","volume":"70","author":"C Wu","year":"2018","unstructured":"Wu, C., Xu, D., Zhang, D., Zhang, P.: Approximation algorithms for the robust\/soft-capacitated 2-level facility location problems. J. Glob. Optim. 70, 207\u2013222 (2018)","journal-title":"J. Glob. Optim."},{"key":"1701_CR26","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."},{"key":"1701_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, D., Hao, C., Wu, C., Xu, D., Zhang, Z.: A local search approximation algorithm for the $$k$$-means problem with penalties. In: Proceedings of the 23rd International Computing and Combinatorics Conference, pp. 568\u2013574 (2017)","DOI":"10.1007\/978-3-319-62389-4_47"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01701-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01701-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01701-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T06:09:20Z","timestamp":1670825360000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01701-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,19]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1701"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01701-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,1,19]]},"assertion":[{"value":"25 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}