{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:29:45Z","timestamp":1758274185024,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_5","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"58-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recycling Inequalities for\u00a0Robust Combinatorial Optimization with\u00a0Budget Uncertainty"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3394-2788","authenticated-orcid":false,"given":"Christina","family":"B\u00fcsing","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9291-0762","authenticated-orcid":false,"given":"Timo","family":"Gersing","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8035-7012","authenticated-orcid":false,"given":"Arie M. C. A.","family":"Koster","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"5_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. Thesis, Technische Universitat Berlin (2007)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., Toth, P.: A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4), 349\u2013360 (2013)","DOI":"10.1007\/s10288-013-0231-6"},{"issue":"2\u20133","key":"5_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","volume":"108","author":"A Atamt\u00fcrk","year":"2006","unstructured":"Atamt\u00fcrk, A.: Strong formulations of robust mixed 0\u20131 programming. Math. Program. 108(2\u20133), 235\u2013250 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10287-015-0236-z","volume":"13","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., Dunning, I., Lubin, M.: Reformulation versus cutting-planes for robust optimization. CMS 13(2), 195\u2013217 (2016)","journal-title":"CMS"},{"issue":"1\u20133","key":"5_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98(1\u20133), 49\u201371 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-022-00232-2","author":"C B\u00fcsing","year":"2023","unstructured":"B\u00fcsing, C., Gersing, T., Koster, A.M.: A branch and bound algorithm for robust binary optimization with budget uncertainty. Math. Program. Comput. (2023). https:\/\/doi.org\/10.1007\/s12532-022-00232-2","journal-title":"Math. Program. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G., et al.: Integer Programming, vol.\u00a0271. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s12532-012-0039-y","volume":"4","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4(3), 239\u2013273 (2012)","journal-title":"Math. Program. Comput."},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Gersing, T.: Algorithms for robust binary optimization, December 2022. https:\/\/doi.org\/10.5281\/zenodo.7463371","DOI":"10.5281\/zenodo.7463371"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Gersing, T., B\u00fcsing, C., Koster, A.: Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty, December 2022. https:\/\/doi.org\/10.5281\/zenodo.7419028","DOI":"10.5281\/zenodo.7419028"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th\u00a0mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"5_CR13","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual, version 9.5 (2022). http:\/\/www.gurobi.com"},{"key":"5_CR14","unstructured":"Hansknecht, C., Richter, A., Stiller, S.: Fast robust shortest path computations. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, coloring, and satisfiability: second DIMACS implementation challenge, 11\u201313 October 1993, vol. 26. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026"},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1287\/ijoo.2019.0042","volume":"3","author":"S Joung","year":"2021","unstructured":"Joung, S., Park, S.: Robust mixed 0\u20131 programming and submodularity. INFORMS J. Optim. 3(2), 183\u2013199 (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0042","journal-title":"INFORMS J. Optim."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Lee, T., Kwon, C.: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty. 4OR 12(4), 373\u2013378 (2014)","DOI":"10.1007\/s10288-014-0270-7"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5(1), 199\u2013215 (1973)","journal-title":"Math. Program."},{"issue":"1","key":"5_CR19","first-page":"115","volume":"13","author":"K Park","year":"2007","unstructured":"Park, K., Lee, K.: A note on robust combinatorial optimization problem. Manag. Sci. Financ. Eng. 13(1), 115\u2013119 (2007)","journal-title":"Manag. Sci. Financ. Eng."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4757-4388-3","DOI":"10.1007\/978-1-4757-4388-3"}],"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-031-32726-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:29:23Z","timestamp":1684700963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All tested algorithms have been implemented in Java and are available on GitHub, see\u00a0[].","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}},{"value":"All test instances used in our computational study are published and available for download, sharing, and reuse, see\u00a0[].","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability"}},{"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":"Madison, WI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","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":"119","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":"28% - 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":"2","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)"}}]}}