{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:38:15Z","timestamp":1742945895847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_25","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"348-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compressing Branch-and-Bound Trees"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[]},{"given":"\u00c1linson S.","family":"Xavier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1287\/moor.1040.0099","volume":"29","author":"K Aardal","year":"2004","unstructured":"Aardal, K., Lenstra, A.: Hard equality constrained integer knapsacks. Math. Oper. Res. 29, 724\u2013738 (2004)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-030-73879-2_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Basu","year":"2021","unstructured":"Basu, A., Conforti, M., Di Summa, M., Jiang, H.: Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. In: Singh, M., Williamson, D.P. (eds.) IPCO 2021. LNCS, vol. 12707, pp. 383\u2013398. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-2_27"},{"doi-asserted-by":"publisher","unstructured":"Beame, P., et al.: Stabbing planes. In: Karlin, A.R. (ed.) 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 94, pp. 10:1\u201310:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.10, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/8341","key":"25_CR4","DOI":"10.4230\/LIPIcs.ITCS.2018.10"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R Bixby","year":"2002","unstructured":"Bixby, R.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Bixby, R., Boyd, E., Indovina, R.: MIPLIB: a test set of mixed integer programming problems. SIAM News (1992)","key":"25_CR6","DOI":"10.21236\/ADA455431"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-59250-3_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"KKH Cheung","year":"2017","unstructured":"Cheung, K.K.H., Gleixner, A., Steffy, D.E.: Verifying integer programming results. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 148\u2013160. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_13"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"V Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V.: Hard knapsack problems. Oper. Res. 28, 1402\u20131411 (1980)","journal-title":"Oper. Res."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-009-0333-2","volume":"130","author":"G Cornu\u00e9jols","year":"2011","unstructured":"Cornu\u00e9jols, G., Liberti, L., Nannicini, G.: Improved strategies for branching on general disjunctions. Math. Program. 130, 225\u2013247 (2011)","journal-title":"Math. Program."},{"unstructured":"Dadush, D., Tiwari, S.: On the complexity of branching proofs. In: Saraf, S. (ed.) 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 169, pp. 34:1\u201334:35. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020)","key":"25_CR10"},{"doi-asserted-by":"crossref","unstructured":"Dey, S., Dubey, Y., Molinaro, M.: Lower bounds on the size of general branch-and-bound trees. Math. Program. (2022)","key":"25_CR11","DOI":"10.1007\/s10107-022-01781-z"},{"unstructured":"Dey, S., Dubey, Y., Molinaro, M., Shah, P.: A theoretical and computational analysis of full strong-branching. arXiv:2110.10754 (2021)","key":"25_CR12"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: Jump: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017). https:\/\/doi.org\/10.1137\/15M1020575","journal-title":"SIAM Rev."},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/ijoc.1120.0531","volume":"25","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Monaci, M.: Backdoor branching. INFORMS J. Comput. 25(4), 693\u2013700 (2018)","journal-title":"INFORMS J. Comput."},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-18008-3_10","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Melchiori, A., Berthold, T., Gleixner, A.M., Salvagnin, D.: Branching on multi-aggregated variables. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 141\u2013156. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_10"},{"doi-asserted-by":"publisher","unstructured":"Gl\u00e4ser, M., Pfetsch, M.: On the complexity of finding shortest variable disjunction branch-and-bound proofs. In: Aardal, K., Sanit\u00e0, L. (eds.) IPCO 2022. LNCS, vol. 13265, pp. 291\u2013304. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_22","key":"25_CR16","DOI":"10.1007\/978-3-031-06901-7_22"},{"unstructured":"Gurobi Optimization: Gurobi Optimizer (Version 9.5). https:\/\/www.gurobi.com\/products\/gurobi-optimizer\/. Accessed 4 Nov 2022","key":"25_CR17"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01580225","volume":"6","author":"R Jeroslow","year":"1974","unstructured":"Jeroslow, R.: Trivial integer programs unsolvble by branch-and-bound. Math. Program. 6, 105\u2013109 (1974)","journal-title":"Math. Program."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-009-0332-3","volume":"128","author":"M Karamanov","year":"2011","unstructured":"Karamanov, M., Cornu\u00e9jols, G.: Branching on general disjunctions. Math. Program. 128, 403\u2013436 (2011)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Khalil, E., Vaezipoor, P., Dilkina, B.: Finding backdoors to integer programs: a Monte Carlo tree search framework. In: Proceedings of AAAI (2022)","key":"25_CR20","DOI":"10.1609\/aaai.v36i4.20293"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1287\/ijoc.2021.1067","volume":"34","author":"B Legat","year":"2021","unstructured":"Legat, B., Dowson, O., Dias Garcia, J., Lubin, M.: MathOptInterface: a data structure for mathematical optimization problems. INFORMS J. Comput. 34(2), 672\u2013689 (2021). https:\/\/doi.org\/10.1287\/ijoc.2021.1067","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J Linderoth","year":"1999","unstructured":"Linderoth, J., Savelsbergh, M.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Mahajan, A., Ralphs, T.: Experiments with branching using general disjunctions. In: Proceedings of Operations Research and Cyber-Infrastructure, pp. 101\u2013118 (2009)","key":"25_CR23","DOI":"10.1007\/978-0-387-88843-9_6"},{"issue":"5","key":"25_CR24","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1137\/080737587","volume":"20","author":"A Mahajan","year":"2010","unstructured":"Mahajan, A., Ralphs, T.: On the complexity of selecting disjunctions in integer programming. SIAM J. Optim. 20(5), 2181\u20132198 (2010)","journal-title":"SIAM J. Optim."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.cor.2013.03.001","volume":"40","author":"H Mahmoud","year":"2013","unstructured":"Mahmoud, H., Chinneck, J.: Achieving MILP feasibility quickly using general disjunctions. Comput. Oper. Res. 40, 2094\u20132102 (2013)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Mehrotra, S., Li, Z.: Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. J. Glob. Optim. (2010)","key":"25_CR26","DOI":"10.1007\/s10898-010-9554-4"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1011207119557","volume":"20","author":"J Owen","year":"2001","unstructured":"Owen, J., Mehrotra, S.: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programs. Comput. Optim. Appl. 20, 159\u2013170 (2001)","journal-title":"Comput. Optim. Appl."},{"doi-asserted-by":"publisher","unstructured":"Walter, M.: Sparsity of lift-and-project cutting planes. In: Helber, S., et al. (eds.) Operations Research Proceedings 2012, pp. 9\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-00795-3_2","key":"25_CR28","DOI":"10.1007\/978-3-319-00795-3_2"},{"unstructured":"Xavier, A.S., Qiu, F.: MIPLearn: a framework for learning-enhanced mixed-integer optimization (Julia interface) (2022). https:\/\/github.com\/ANL-CEEESA\/MIPLearn.jl","key":"25_CR29"},{"doi-asserted-by":"crossref","unstructured":"Yang, Y., Boland, N., Savelsbergh, M.: Multivariable branching: a 0\u20131 knapsack problem case study. INFORMS J. Comput. 33(4), 1354\u20131367 (2021)","key":"25_CR30","DOI":"10.1287\/ijoc.2020.1052"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:31:28Z","timestamp":1684701088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_25","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":"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)"}}]}}