{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:34Z","timestamp":1781305054066,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_31","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:31Z","timestamp":1781303671000},"page":"474-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Strength of\u00a0Root Cuts in\u00a0an\u00a0Extended Abstract Branch-and-Cut Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1527-2336","authenticated-orcid":false,"given":"Boyang","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-9565","authenticated-orcid":false,"given":"Aleksandr M.","family":"Kazachkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/s00493-022-4884-7","volume":"42","author":"A Basu","year":"2022","unstructured":"Basu, A., Conforti, M., Di Summa, M., Jiang, H.: Complexity of branch-and-bound and cutting planes in mixed-integer optimization\u2013II. Combinatorica 42, 971\u2013996 (2022). https:\/\/doi.org\/10.1007\/s00493-022-4884-7","journal-title":"Combinatorica"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s10107-022-01789-5","volume":"198","author":"A Basu","year":"2023","unstructured":"Basu, A., Conforti, M., Di Summa, M., Jiang, H.: Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198(1), 787\u2013810 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01789-5","journal-title":"Math. Program."},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s12532-025-00278-y","volume":"17","author":"T Berthold","year":"2025","unstructured":"Berthold, T., Francobaldi, M., Hendel, G.: Learning to use local cuts. Math. Program. Comput. 17(3), 437\u2013450 (2025). https:\/\/doi.org\/10.1007\/s12532-025-00278-y","journal-title":"Math. Program. Comput."},{"key":"31_CR4","unstructured":"Cheng, H., Basu, A.: Generalization guarantees for learning score-based branch-and-cut policies in integer programming. In: The Thirty-Ninth Annual Conference on Neural Information Processing Systems (2025). https:\/\/openreview.net\/forum?id=v5ru9MGjsW"},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Dadush, D., Tiwari, S.: On the complexity of branching proofs. In: Proceedings of the 35th Computational Complexity Conference. CCC 2020. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2020.34","DOI":"10.4230\/LIPIcs.CCC.2020.34"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-022-01781-z","volume":"198","author":"SS Dey","year":"2023","unstructured":"Dey, S.S., Dubey, Y., Molinaro, M.: Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1), 539\u2013559 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01781-z","journal-title":"Math. Program."},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10107-023-01977-x","volume":"205","author":"SS Dey","year":"2024","unstructured":"Dey, S.S., Dubey, Y., Molinaro, M., Shah, P.: A theoretical and computational analysis of full strong-branching. Math. Program. 205(1), 303\u2013336 (2024). https:\/\/doi.org\/10.1007\/s10107-023-01977-x","journal-title":"Math. Program."},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/21M1399956","volume":"32","author":"SS Dey","year":"2022","unstructured":"Dey, S.S., Kazachkov, A., Lodi, A., Munoz, G.: Cutting plane generation through sparse principal component analysis. SIAM J. Optim. 32(2), 1319\u20131343 (2022). https:\/\/doi.org\/10.1137\/21M1399956","journal-title":"SIAM J. Optim."},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1302-4","volume":"170","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M.: Theoretical challenges towards cutting-plane selection. Math. Program. 170(1), 237\u2013266 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1302-4","journal-title":"Math. Program."},{"issue":"5","key":"31_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solution to linear programs. Bull. Am. Math. Soc. 64(5), 275\u2013278 (1958). https:\/\/doi.org\/10.1090\/S0002-9904-1958-10224-4","journal-title":"Bull. Am. Math. Soc."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, vol. 10, pp. 211\u2013215. Providence, RI (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"31_CR12","first-page":"260","volume":"64","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. Recent Adv. Math. Program. 64, 260\u2013302 (1963)","journal-title":"Recent Adv. Math. Program."},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.M., Le\u00a0Bodic, P., Sankaranarayanan, S.: An abstract model for branch-and-cut. In: Aardal, K., Sanit\u00e0, L. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, pp. 333\u2013346. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_25","DOI":"10.1007\/978-3-031-06901-7_25"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-023-01991-z","volume":"206","author":"AM Kazachkov","year":"2024","unstructured":"Kazachkov, A.M., Le Bodic, P., Sankaranarayanan, S.: An abstract model for branch and cut. Math. Program. 206(1), 175\u2013202 (2024). https:\/\/doi.org\/10.1007\/s10107-023-01991-z","journal-title":"Math. Program."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520 (1960). https:\/\/doi.org\/10.2307\/1910129","journal-title":"Econometrica"},{"issue":"1\u20132","key":"31_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-016-1101-8","volume":"166","author":"P Le Bodic","year":"2017","unstructured":"Le Bodic, P., Nemhauser, G.: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1\u20132), 369\u2013405 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1101-8","journal-title":"Math. Program."},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958-2008","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 647\u2013686. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"key":"31_CR18","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-89920-6_21","volume-title":"Operations Research Proceedings 2017","author":"M Miltenberger","year":"2018","unstructured":"Miltenberger, M., Ralphs, T., Steffy, D.E.: Exploring the numerics of branch-and-cut for mixed integer linear optimization. In: Kliewer, N., Ehmke, J.F., Bornd\u00f6rfer, R. (eds.) Operations Research Proceedings 2017. ORP, pp. 151\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_21"},{"key":"31_CR19","doi-asserted-by":"publisher","unstructured":"Shah, P., Dey, S.S.,Molinaro, M.: Non-monotonicity of branching rules with respect to linear relaxations. INFORMS J. Comput. 38(1), 53\u201366 (2025). https:\/\/doi.org\/10.1287\/ijoc.2024.0709","DOI":"10.1287\/ijoc.2024.0709"},{"key":"31_CR20","doi-asserted-by":"publisher","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. 130(1, Ser. A), 153\u2013176 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0335-0","DOI":"10.1007\/s10107-009-0335-0"}],"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-032-28691-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:33Z","timestamp":1781303673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}