{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:44:25Z","timestamp":1767109465709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"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-73879-2_18","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"252-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Power of Static Assignment Policies for Robust Facility Location Problems"],"prefix":"10.1007","author":[{"given":"Omar","family":"El Housni","sequence":"first","affiliation":[]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"David","family":"Shmoys","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/moor.1090.0428","volume":"35","author":"B Anthony","year":"2010","unstructured":"Anthony, B., Goyal, V., Gupta, A., Nagarajan, V.: A plant location guide for the unsure: approximation algorithms for min-max location problems. Math. Oper. Res. 35(1), 79\u2013101 (2010)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55(4), 662\u2013673 (2007)","journal-title":"Oper. Res."},{"key":"18_CR3","unstructured":"Basciftci, B., Ahmed, S., Shen, S.: Distributionally robust facility location problem under decision-dependent stochastic demand. arXiv preprint arXiv:1912.05577 (2019)"},{"key":"18_CR4","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 642\u2013651 (2001)"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"18_CR6","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: approximation algorithms for demand-robust covering problems. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 367\u2013376 (2005)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"El Housni, O., Goyal, V.: On the optimality of affine policies for budgeted uncertainty sets. Mathematics of Operations Research (2021, to appear)","DOI":"10.1287\/moor.2020.1082"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-72792-7_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"U Feige","year":"2007","unstructured":"Feige, U., Jain, K., Mahdian, M., Mirrokni, V.: Robust combinatorial optimization with exponential scenarios. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 439\u2013453. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_33"},{"issue":"1","key":"18_CR9","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":"1\u20132","key":"18_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-013-0705-5","volume":"146","author":"A Gupta","year":"2014","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Thresholded covering algorithms for robust and max-min optimization. Math. Program. 146(1\u20132), 583\u2013615 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"18_CR11","first-page":"10","volume":"12","author":"A Gupta","year":"2016","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Robust and maxmin optimization under matroid and knapsack uncertainty sets. ACM Trans. Algorithms (TALG) 12(1), 10 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"18_CR12","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 Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"18_CR13","unstructured":"Housni, O.E., Goyal, V., Shmoys, D.: On the power of static assignment policies for robust facility location problems. arXiv preprint arXiv:2011.04925 (2020)"},{"key":"18_CR14","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 691\u2013700 (2004)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00453-011-9596-0","volume":"65","author":"R Khandekar","year":"2013","unstructured":"Khandekar, R., Kortsarz, G., Mirrokni, V., Salavatipour, M.R.: Two-stage robust network design with exponential scenarios. Algorithmica 65(2), 391\u2013408 (2013)","journal-title":"Algorithmica"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Linhares, A., Swamy, C.: Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. In: Proceedings of the 51st Annual ACM Symposium on Theory of Computing, pp. 768\u2013779 (2019)","DOI":"10.1145\/3313276.3316391"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-25960-2_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Ravi","year":"2004","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: approximation algorithms for stochastic optimization problems. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 101\u2013115. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25960-2_8"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B.: Approximation algorithms for facility location problems. In: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 27\u201333 (2000)","DOI":"10.1007\/3-540-44436-X_4"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"7","key":"18_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38(7), 547\u2013564 (2006)","journal-title":"IIE Trans."},{"issue":"1","key":"18_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:07:09Z","timestamp":1620169629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_18","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":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","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":"33","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":"37% - 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":"15","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)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}