{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:39:58Z","timestamp":1742636398980},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T00:00:00Z","timestamp":1354752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10878-012-9573-9","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T23:57:27Z","timestamp":1354751847000},"page":"496-504","source":"Crossref","is-referenced-by-count":1,"title":["Approximating soft-capacitated facility location problem with uncertainty"],"prefix":"10.1007","volume":"28","author":[{"given":"Shuxin","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaohua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,6]]},"reference":[{"key":"9573_CR1","doi-asserted-by":"crossref","unstructured":"Arya V, Garg, N, Khandekar R, Meyerson A, Munagala K, Pandit V (2001) Local search heuristics for k-median and facility location problems. In: Proceedings of 33rd ACM symposium on theory of computing","DOI":"10.1145\/380752.380755"},{"key":"9573_CR2","unstructured":"Bauer P, Enders R (1997) A capacitated facility location problem with integer decision variables. In: International symposium on mathematical programming (ISMP)"},{"key":"9573_CR3","unstructured":"Byrka J, Ghodsi M, Srinivasan A (2010a) Lp-rounding algorithms for facility-location problems. arXiv:1007.3611"},{"key":"9573_CR4","doi-asserted-by":"crossref","unstructured":"Byrka J, Srinivasan A, Swamy C (2010b) Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. In: IPCO, pp 244\u2013257","DOI":"10.1007\/978-3-642-13036-6_19"},{"key":"9573_CR5","unstructured":"Chechik S, Peleg D (2010) Robust fault tolerant uncapacitated facility location. In: STACS, pp 191\u2013202"},{"key":"9573_CR6","doi-asserted-by":"crossref","unstructured":"Chudak F, Shmoys D (1999) Improved approximation algorithms for the capacitated facility location problem. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, pp 875\u2013876","DOI":"10.1007\/3-540-48777-8_8"},{"key":"9573_CR7","doi-asserted-by":"crossref","unstructured":"Jain K, Vazirani V (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J ACM 48:274\u2013296","DOI":"10.1145\/375827.375845"},{"key":"9573_CR8","doi-asserted-by":"crossref","unstructured":"Jain K, Mahdian M, Saberi A (2002) A new greedy approach for facility location problems. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. ACM, New York, pp 731\u2013740","DOI":"10.1145\/509907.510012"},{"key":"9573_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.ipl.2012.02.004","volume":"112","author":"Y Li","year":"2012","unstructured":"Li Y, Xu D, Du D, Xiu N (2012a) Improved approximation algorithms for the robust fault-tolerant facility location problem. Inf Process Lett 112:361\u2013364","journal-title":"Inf Process Lett"},{"key":"9573_CR10","doi-asserted-by":"crossref","unstructured":"Li Y, Du D, Xiu N, Xu D (2012b) Improved approximation algorithms for the facility location problems with linear\/submodular penalty. Optimization (online)","DOI":"10.1007\/978-3-642-38768-5_27"},{"key":"9573_CR11","unstructured":"Mahdian M, Ye Y, Zhang J (2003) A 2-approximation algorithm for the soft-capacitated facility location problem. In: Arora S, Jansen K, Rolim J, Sahai A (eds) RANDOM 2003 and APPROX 2003. LNCS, vol 2764, pp 129\u2013140"},{"issue":"2","key":"9573_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J Comput 36(2):411\u2013432","journal-title":"SIAM J Comput"},{"key":"9573_CR13","unstructured":"Roy TJV, Erlenkotter D (2002) A dual-based procedure for dynamic facility location. Manag Sci 28:1091\u20131105"},{"key":"9573_CR14","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"L Snyder","year":"2007","unstructured":"Snyder L (2007) Facility location under uncertainty: a review. IIE Trans 38:547\u2013564","journal-title":"IIE Trans"},{"key":"9573_CR15","unstructured":"Srinivasan A (2007) Approximation algorithms for stochastic and risk-averse optimization. In: Proceedings of the 18th SODA, pp 1305\u20131313"},{"key":"9573_CR16","unstructured":"Swamy C (2004) Approximation algorithms for clustering problems. Ph.D. thesis, Cornell University, Ithaca, NY"},{"key":"9573_CR17","unstructured":"Swamy C, Shmoys D (2005) Sampling-based approximation algorithms for multi-stage stochastic optimization. In: FOCS, pp 357\u2013366"},{"key":"9573_CR18","doi-asserted-by":"crossref","unstructured":"Ye Y, Zhang J (2006) An approximation algorithm for the dynamic facility location problem. Comb Optim Commun Netw 18:623\u2013637","DOI":"10.1007\/0-387-29026-5_22"},{"key":"9573_CR19","doi-asserted-by":"crossref","unstructured":"Zhang J, Chen B, Ye Y (2005) A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res 30:389\u2013403","DOI":"10.1287\/moor.1040.0125"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9573-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9573-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9573-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T18:40:03Z","timestamp":1562438403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9573-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9573"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9573-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,6]]}}}