{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:04:43Z","timestamp":1743120283109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_5","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"47-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Stochastic k-Facility Location"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5209-107X","authenticated-orcid":false,"given":"Yicheng","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6262-3516","authenticated-orcid":false,"given":"Chunlin","family":"Hao","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8730-3711","authenticated-orcid":false,"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jairtraman.2015.06.001","volume":"47","author":"A Adibi","year":"2015","unstructured":"Adibi, A., Razmi, J.: 2-stage stochastic programming approach for hub location problem under uncertainty: a case study of air network of Iran. J. Air Transp. Manag. 47, 172\u2013178 (2015)","journal-title":"J. Air Transp. Manag."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2020.11.002","volume":"292","author":"B Basciftci","year":"2021","unstructured":"Basciftci, B., Ahmed, S., Shen, S.: Distributionally robust facility location problem under decision-dependent stochastic demand. Eur. J. Oper. Res. 292, 548\u2013561 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0237-4"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for $$k$$-median, and positive correlation in budgeted optimization. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 737\u2013756 (2014)","DOI":"10.1137\/1.9781611973730.50"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63, 191\u2013200 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0270-0255(82)90039-2","volume":"3","author":"YM Ermoliev","year":"1982","unstructured":"Ermoliev, Y.M., Leonardi, G.: Some proposals for stochastic facility location models. Math. Modelling 3(5), 407\u2013420 (1982)","journal-title":"Math. Modelling"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"issue":"1","key":"5_CR8","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(1), 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s11590-018-1238-x","volume":"12","author":"L Han","year":"2018","unstructured":"Han, L., Xu, D., Li, M., Zhang, D.: Approximation algorithms for the robust facility leasing problem. Optim. Lett. 12(3), 625\u2013637 (2018). https:\/\/doi.org\/10.1007\/s11590-018-1238-x","journal-title":"Optim. Lett."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10878-017-0179-0","volume":"35","author":"L Han","year":"2018","unstructured":"Han, L., Xu, D., Du, D., Zhang, D.: A local search approximation algorithm for the uniform capacitated k-facility location problem. J. Comb. Optim. 35(2), 409\u2013423 (2018)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-006-0140-6","volume":"152","author":"R Hochreiter","year":"2007","unstructured":"Hochreiter, R., Pflug, G.C.: Financial scenario generation for stochastic multi-stage decision processes as facility location problems. Ann. Oper. Res. 152(1), 257\u2013272 (2007)","journal-title":"Ann. Oper. Res."},{"key":"5_CR12","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."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02027380","volume":"6","author":"FV Louveaux","year":"1986","unstructured":"Louveaux, F.V.: Discrete stochastic location models. Ann. Oper. Res. 6(2), 21\u201334 (1986)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1287\/opre.40.3.564","volume":"40","author":"FV Louveaux","year":"1992","unstructured":"Louveaux, F.V., Peeters, D.: A dual-based procedure for stochastic facility location. Oper. Res. 40(3), 564\u2013573 (1992)","journal-title":"Oper. Res."},{"key":"5_CR15","unstructured":"Mahdian, M.: Facility location and the analysis of algorithms through factor-revealing problems, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (2004)"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/trsc.13.2.85","volume":"13","author":"PB Mirchandani","year":"1979","unstructured":"Mirchandani, P.B., Odoni, A.R.: Locations of medians on stochastic networks. Transp. Sci. 13(2), 85\u201397 (1979)","journal-title":"Transp. Sci."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(85)90096-7","volume":"21","author":"PB Mirchandani","year":"1985","unstructured":"Mirchandani, P.B., Oudjit, A., Wong, R.T.: Multidimensional extensions and a nested dual approach for the m-median problem. Eur. J. Oper. Res. 21(1), 121\u2013137 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","volume":"108","author":"R Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithms for stochastic optimization problems. Math. Program. 108(1), 97\u2013114 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1122480.1122493","volume":"37","author":"C Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News 37(1), 33\u201346 (2006)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.orl.2009.01.005","volume":"37","author":"R Tadei","year":"2009","unstructured":"Tadei, R., Ricciardi, N., Perboli, G.: The stochastic $$p$$-median problem with unknown cost probability distribution. Oper. Res. Lett. 37(2), 135\u2013141 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2007.05.024","volume":"384","author":"P Zhang","year":"2007","unstructured":"Zhang, P.: A new approximation algorithm for the k-facility location problem. Theoret. Comput. Sci. 384(1), 126\u2013135 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:44:43Z","timestamp":1641015883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}