{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:08:39Z","timestamp":1768723719442,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T00:00:00Z","timestamp":1450051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["283106"],"award-info":[{"award-number":["283106"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501412"],"award-info":[{"award-number":["11501412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10898-015-0394-0","type":"journal-article","created":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T05:26:40Z","timestamp":1450070800000},"page":"367-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Local search algorithm for universal facility location problem with linear penalties"],"prefix":"10.1007","volume":"67","author":[{"given":"Yicheng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,14]]},"reference":[{"key":"394_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Anand, L., Bansal, M., Garg, N.: A 3-approximation for facility location with uniform capacities. In: 14th Conference on Integer Programming and Combinatorial Optimization, pp. 149\u2013162 (2010)","DOI":"10.1007\/978-3-642-13036-6_12"},{"key":"394_CR2","doi-asserted-by":"crossref","unstructured":"An, H.C., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. In: 55th Annual Symposium on Foundations of Computer Science, pp. 256\u2013265 (2014)","DOI":"10.1109\/FOCS.2014.35"},{"key":"394_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10878-014-9711-7","volume":"29","author":"E Angel","year":"2015","unstructured":"Angel, E., Thang, N.K., Regnault, D.: Improved local search for universal facility location. J. Comb. Optim. 29, 237\u2013246 (2015)","journal-title":"J. Comb. Optim."},{"key":"394_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"key":"394_CR5","doi-asserted-by":"crossref","unstructured":"Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: 7th Conference on Integer Programming and Combinatorial Optimization, pp. 99\u2013113 (1999)","DOI":"10.1007\/3-540-48777-8_8"},{"key":"394_CR6","unstructured":"Gupta, N., Gupta, S.: Approximation algorithms for capacitated facility location problem with penalties (2014). arXiv:1408.4944"},{"key":"394_CR7","doi-asserted-by":"crossref","first-page":"28","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, 28\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"394_CR8","unstructured":"Garg, N., Khandekar, R., Pandit, V.: Improved approximation for universal facility location. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 959\u2013960 (2005)"},{"key":"394_CR9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37, 66\u201384 (2000)","journal-title":"J. Algorithms"},{"key":"394_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146\u2013188 (2000)","journal-title":"J. Algorithms"},{"key":"394_CR11","doi-asserted-by":"crossref","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 penalty. Algorithmica 73, 460\u2013482 (2015)","journal-title":"Algorithmica"},{"key":"394_CR12","first-page":"1","volume":"57","author":"G Li","year":"2014","unstructured":"Li, G., Du, D., Xu, D., Zhang, 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."},{"key":"394_CR13","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1007\/s11425-013-4704-z","volume":"56","author":"Y Li","year":"2013","unstructured":"Li, Y., Xiu, N., Xu, D.: An approximation algorithm for the $$k$$ k -median warehouse-retailer network design problem. Sci. China Math. 56, 2381\u20132388 (2013)","journal-title":"Sci. China Math."},{"key":"394_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Pal, M.: Universal facility location. In: 11th Annual European Symposium on Algorithms, pp. 409\u2013421 (2003)","DOI":"10.1007\/978-3-540-39658-1_38"},{"key":"394_CR15","doi-asserted-by":"crossref","unstructured":"Pal, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: 42nd Annual Symposium on Foundations of Computer Science, pp. 329\u2013338 (2001)","DOI":"10.1109\/SFCS.2001.959907"},{"key":"394_CR16","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"KA Ravindra","year":"1993","unstructured":"Ravindra, K.A., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"394_CR17","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.orl.2006.08.004","volume":"35","author":"J Vygen","year":"2007","unstructured":"Vygen, J.: From stars to comets: improved local search for universal facility location. Oper. Res. Lett. 35, 427\u2013433 (2007)","journal-title":"Oper. Res. Lett."},{"key":"394_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2005.01.005","volume":"94","author":"G Xu","year":"2005","unstructured":"Xu, G., Xu, J.: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf. Process. Lett. 94, 119\u2013123 (2005)","journal-title":"Inf. Process. Lett."},{"key":"394_CR19","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/s10878-007-9127-8","volume":"17","author":"G Xu","year":"2009","unstructured":"Xu, G., Xu, J.: An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17, 424\u2013436 (2009)","journal-title":"J. Comb. Optim."},{"key":"394_CR20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J Zhang","year":"2005","unstructured":"Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. Math. Oper. Res. 30, 389\u2013403 (2005)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0394-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0394-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0394-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:10Z","timestamp":1559264350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0394-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,14]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0394-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,14]]}}}