{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T14:39:00Z","timestamp":1768055940944,"version":"3.49.0"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0340"],"award-info":[{"award-number":["FA9550-23-1-0340"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI1560828"],"award-info":[{"award-number":["CMMI1560828"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-15-12082"],"award-info":[{"award-number":["N00014-15-12082"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10107-025-02227-y","type":"journal-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T10:11:44Z","timestamp":1747217504000},"page":"507-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$\\mathcal {V}$$-polyhedral disjunctive cuts"],"prefix":"10.1007","volume":"215","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-9565","authenticated-orcid":false,"given":"Aleksandr M.","family":"Kazachkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"issue":"1","key":"2227_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.006","journal-title":"Discrete Optim."},{"issue":"4","key":"2227_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009","journal-title":"Oper. Res. Lett."},{"issue":"3, Ser. A","key":"2227_CR3","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 102(3, Ser. A), 457\u2013493 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0558-z","journal-title":"Math. Program."},{"key":"2227_CR4","doi-asserted-by":"publisher","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Integer Programming and Combinatorial Optimization, Volume 4513 of Lecture Notes in Computer Science, pp. 1\u201315. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_1","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"2227_CR5","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Finding cuts in the TSP (a preliminary report). Center for Discrete Mathematics & Theoretical Computer Science, Technical report (1995)"},{"key":"2227_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70342-X","journal-title":"Ann. Discrete Math."},{"issue":"2\u20133","key":"2227_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-009-0006-4","volume":"1","author":"E Balas","year":"2009","unstructured":"Balas, E., Bonami, P.: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Math. Program. Comput. 1(2\u20133), 165\u2013199 (2009). https:\/\/doi.org\/10.1007\/s12532-009-0006-4","journal-title":"Math. Program. Comput."},{"key":"2227_CR8","doi-asserted-by":"publisher","unstructured":"Balas, E., Kazachkov, A.M.: $$\\cal{V}$$-polyhedral disjunctive cuts (2024). https:\/\/doi.org\/10.48550\/arXiv.2207.13619. (Extended manuscript)","DOI":"10.48550\/arXiv.2207.13619"},{"key":"2227_CR9","doi-asserted-by":"publisher","unstructured":"Balas, E., Kis, T.: On the relationship between standard intersection cuts, lift-and-project cuts and generalized intersection cuts. Math. Program. 1\u201330 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0975-1","DOI":"10.1007\/s10107-015-0975-1"},{"issue":"1\u20132, Ser. A","key":"2227_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"137","author":"E Balas","year":"2013","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1\u20132, Ser. A), 19\u201335 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0483-x","journal-title":"Math. Program."},{"issue":"1\u20133","key":"2227_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift-and-project for mixed 0-1 programming: recent progress. Discrete Appl. Math. 123(1\u20133), 129\u2013154 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00340-7","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"2227_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Program. 94(2\u20133), 221\u2013245 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0317-y","journal-title":"Math. Program."},{"issue":"3, Ser. A","key":"2227_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58(3, Ser. A), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/BF01581273","journal-title":"Math. Program."},{"issue":"9","key":"2227_CR14","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Man. Sci. 42(9), 1229\u20131246 (1996). https:\/\/doi.org\/10.1287\/mnsc.42.9.1229","journal-title":"Man. Sci."},{"issue":"2, Ser. B","key":"2227_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-010-0392-4","volume":"125","author":"E Balas","year":"2010","unstructured":"Balas, E., Fischetti, M., Zanette, A.: On the enumerative nature of Gomory\u2019s dual cutting plane method. Math. Program. 125(2, Ser. B), 325\u2013351 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0392-4","journal-title":"Math. Program."},{"key":"2227_CR16","doi-asserted-by":"publisher","unstructured":"Basu, A., Cornu\u00e9jols, G., Molinaro, M.: A probabilistic analysis of the strength of the split and triangle closures. In: Integer Programming and Combinatorial Optimization, Volume 6655 of Lecture Notes in Computer Science, pp. 27\u201338. Springer, Heidelberg (2011a). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_3","DOI":"10.1007\/978-3-642-20807-2_3"},{"key":"2227_CR17","doi-asserted-by":"publisher","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Algorithmic and complexity results for cutting planes derived from maximal lattice-free convex sets (2011b). https:\/\/doi.org\/10.48550\/arXiv.1107.5068","DOI":"10.48550\/arXiv.1107.5068"},{"key":"2227_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01580451","volume":"8","author":"DE Bell","year":"1975","unstructured":"Bell, D.E., Fisher, M.L.: Improved integer programming bounds using intersections of corner polyhedra. Math. Program. 8, 345\u2013368 (1975). https:\/\/doi.org\/10.1007\/BF01580451","journal-title":"Math. Program."},{"key":"2227_CR19","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"2227_CR20","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"2","key":"2227_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0037-0","journal-title":"Math. Program. Comput."},{"issue":"4","key":"2227_CR22","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.orl.2008.01.004","volume":"36","author":"C Buchheim","year":"2008","unstructured":"Buchheim, C., Liers, F., Oswald, M.: Local cuts revisited. Oper. Res. Lett. 36(4), 430\u2013433 (2008). https:\/\/doi.org\/10.1016\/j.orl.2008.01.004","journal-title":"Oper. Res. Lett."},{"key":"2227_CR23","unstructured":"COIN-OR Branch and Cut. https:\/\/github.com\/coin-or\/Cbc"},{"key":"2227_CR24","unstructured":"COIN-OR Linear Programming. https:\/\/github.com\/coin-or\/Clp"},{"issue":"1\u20132","key":"2227_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s13675-012-0006-4","volume":"1","author":"F Cadoux","year":"2013","unstructured":"Cadoux, F., Lemar\u00e9chal, C.: Reflections on generating (disjunctive) cuts. EURO J. Comput. Optim. 1(1\u20132), 51\u201369 (2013). https:\/\/doi.org\/10.1007\/s13675-012-0006-4","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"2227_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/opre.1100.0882","volume":"59","author":"B Chen","year":"2011","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Finite disjunctive programming characterizations for general mixed-integer linear programs. Oper. Res. 59(1), 202\u2013210 (2011). https:\/\/doi.org\/10.1287\/opre.1100.0882","journal-title":"Oper. Res."},{"issue":"1","key":"2227_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.orl.2011.10.009","volume":"40","author":"B Chen","year":"2012","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. Oper. Res. Lett. 40(1), 15\u201319 (2012). https:\/\/doi.org\/10.1016\/j.orl.2011.10.009","journal-title":"Oper. Res. Lett."},{"key":"2227_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-02019-2","author":"R Chen","year":"2023","unstructured":"Chen, R., Luedtke, J.: Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-02019-2","journal-title":"Math. Program."},{"issue":"2","key":"2227_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s12532-013-0052-9","volume":"5","author":"V Chv\u00e1tal","year":"2013","unstructured":"Chv\u00e1tal, V., Cook, W., Espinoza, D.: Local cuts for mixed-integer programming. Math. Program. Comput. 5(2), 171\u2013200 (2013). https:\/\/doi.org\/10.1007\/s12532-013-0052-9","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2227_CR30","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-018-1299-8","volume":"178","author":"M Conforti","year":"2019","unstructured":"Conforti, M., Wolsey, L.A.: \u201cFacet\u2019\u2019 separation with one linear program. Math. Program. 178(1), 361\u2013380 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1299-8","journal-title":"Math. Program."},{"issue":"1","key":"2227_CR31","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.2022.1248","volume":"35","author":"C Contardo","year":"2022","unstructured":"Contardo, C., Lodi, A., Tramontani, A.: Cutting planes from the branch-and-bound tree: challenges and opportunities. INFORMS J. Comput. 35(1), 2\u20134 (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1248","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"2227_CR32","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W Cook","year":"2009","unstructured":"Cook, W., Dash, S., Fukasawa, R., Goycoolea, M.: Numerically safe Gomory mixed-integer cuts. INFORMS J. Comput. 21(4), 641\u2013649 (2009). https:\/\/doi.org\/10.1287\/ijoc.1090.0324","journal-title":"INFORMS J. Comput."},{"issue":"3, Ser. A","key":"2227_CR33","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Lemar\u00e9chal, C.: A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3, Ser. A), 567\u2013586 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0670-8","journal-title":"Math. Program."},{"issue":"4","key":"2227_CR34","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1287\/ijoc.2014.0598","volume":"26","author":"S Dash","year":"2014","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26(4), 780\u2013797 (2014). https:\/\/doi.org\/10.1287\/ijoc.2014.0598","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"2227_CR35","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-012-0198-8","volume":"10","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3), 221\u2013244 (2012). https:\/\/doi.org\/10.1007\/s10288-012-0198-8","journal-title":"4OR"},{"key":"2227_CR36","first-page":"2","volume":"66","author":"MC Ferris","year":"2001","unstructured":"Ferris, M.C., Pataki, G., Schmieta, S.: Solving the seymour problem. Optima 66, 2\u20136 (2001)","journal-title":"Optima"},{"issue":"1\u20132, Ser. A","key":"2227_CR37","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10107-009-0300-y","volume":"128","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128(1\u20132, Ser. A), 205\u2013230 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0300-y","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"2227_CR38","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-012-0615-y","volume":"144","author":"D Gade","year":"2014","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math. Program. 144(1\u20132, Ser. A), 39\u201364 (2014). https:\/\/doi.org\/10.1007\/s10107-012-0615-y","journal-title":"Math. Program."},{"key":"2227_CR39","doi-asserted-by":"publisher","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Yuji Shinano, M.: Data-driven compilation of the 6th mixed-integer programming library. Math. Prog. Comput. 2021,(2017). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","DOI":"10.1007\/s12532-020-00194-3"},{"key":"2227_CR40","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"RE Gomory","year":"1965","unstructured":"Gomory, R.E.: On the relation between integer and noninteger solutions to linear programs. Proc. Nat. Acad. Sci. U.S.A. 53, 260\u2013265 (1965). https:\/\/doi.org\/10.1073\/pnas.53.2.260","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"2227_CR41","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 solutions to linear programs. Bull. Am. Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"2227_CR42","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969). https:\/\/doi.org\/10.1016\/0024-3795(69)90017-2","journal-title":"Linear Algebra Appl."},{"key":"2227_CR43","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com. Version 10.0.3"},{"issue":"1","key":"2227_CR44","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Int. Res. 36(1), 267\u2013306 (2009). https:\/\/doi.org\/10.1613\/jair.2861","journal-title":"J. Artif. Int. Res."},{"key":"2227_CR45","unstructured":"J\u00f6rg, M.: $$k$$-disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. PhD thesis, Technischen Universit\u00e4t M\u00fcnchen, 8 (2008)"},{"key":"2227_CR46","unstructured":"Karamanov, M.: Branch and cut: an empirical study. PhD thesis, Carnegie Mellon University, 9 (2006)"},{"key":"2227_CR47","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.M.: Non-recursive cut generation. PhD thesis, Carnegie Mellon University, (2018). https:\/\/doi.org\/10.1184\/R1\/6720881.v1","DOI":"10.1184\/R1\/6720881.v1"},{"key":"2227_CR48","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.M., Balas, E.: Monoidal strengthening of simple $$\\cal{V}$$-polyhedral disjunctive cuts. In: Del\u00a0Pia, A., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization, Volume 13904 of Lecture Notes in Computer Science, pp. 275\u2013290. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_20","DOI":"10.1007\/978-3-031-32726-1_20"},{"issue":"1","key":"2227_CR49","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12532-019-00166-2","volume":"12","author":"AM Kazachkov","year":"2020","unstructured":"Kazachkov, A.M., Nadarajah, S., Balas, E., Margot, F.: Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12(1), 69\u2013107 (2020). https:\/\/doi.org\/10.1007\/s12532-019-00166-2","journal-title":"Math. Program. Comput."},{"key":"2227_CR50","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-023-01991-z","volume":"206","author":"AM Kazachkov","year":"2023","unstructured":"Kazachkov, A.M., Le Bodic, P., Sankaranarayanan, S.: An abstract model for branch and cut. Math. Program. 206, 175\u2013202 (2023). https:\/\/doi.org\/10.1007\/s10107-023-01991-z","journal-title":"Math. Program."},{"issue":"2","key":"2227_CR51","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010: mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"2227_CR52","unstructured":"Linderoth, J., Ralphs, T.K.: Computational optimization research at lehigh. MIP instances. http:\/\/coral.ise.lehigh.edu\/data-sets\/mixed-integer-instances\/ (2020). Accessed Sept 2020"},{"issue":"1\u20132","key":"2227_CR53","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10107-022-01844-1","volume":"199","author":"A Lodi","year":"2023","unstructured":"Lodi, A., Tanneau, M., Vielma, J.-P.: Disjunctive cuts in mixed-integer conic optimization. Math. Program. 199(1\u20132), 671\u2013719 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01844-1","journal-title":"Math. Program."},{"key":"2227_CR54","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The common optimization INterface for operations research: promoting open-source software in the operations research community. IBM J. Res. Dev. 47, 82 (2003)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"2227_CR55","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s12532-014-0076-9","volume":"7","author":"Q Louveaux","year":"2015","unstructured":"Louveaux, Q., Poirrier, L., Salvagnin, D.: The strength of multi-row models. Math. Program. Comput. 7(2), 113\u2013148 (2015). https:\/\/doi.org\/10.1007\/s12532-014-0076-9","journal-title":"Math. Program. Comput."},{"key":"2227_CR56","doi-asserted-by":"publisher","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, pp. 151\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_21","DOI":"10.1007\/978-3-319-89920-6_21"},{"issue":"1","key":"2227_CR57","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1090.0693","volume":"58","author":"L Ntaimo","year":"2010","unstructured":"Ntaimo, L.: Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse. Oper. Res. 58(1), 229\u2013243 (2010). https:\/\/doi.org\/10.1287\/opre.1090.0693","journal-title":"Oper. Res."},{"issue":"3","key":"2227_CR58","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10898-007-9245-y","volume":"41","author":"L Ntaimo","year":"2008","unstructured":"Ntaimo, L., Tanner, M.W.: Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs. J. Global Optim. 41(3), 365\u2013384 (2008). https:\/\/doi.org\/10.1007\/s10898-007-9245-y","journal-title":"J. Global Optim."},{"key":"2227_CR59","doi-asserted-by":"publisher","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Integer Programming and Combinatorial Optimization, Volume 2081 of Lecture Notes in Computer Sciemce, pp. 348\u2013360. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_27","DOI":"10.1007\/3-540-45535-3_27"},{"issue":"1\u20132, Ser. A","key":"2227_CR60","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10107-016-1006-6","volume":"161","author":"Y Qi","year":"2017","unstructured":"Qi, Y., Sen, S.: The ancestral Benders\u2019 cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math. Program. 161(1\u20132, Ser. A), 193\u2013235 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1006-6","journal-title":"Math. Program."},{"issue":"2","key":"2227_CR61","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S Sen","year":"2006","unstructured":"Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math. Program. 106(2), 203\u2013223 (2006). https:\/\/doi.org\/10.1007\/s10107-005-0592-5","journal-title":"Math. Program."},{"issue":"1","key":"2227_CR62","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10479-020-03709-2","volume":"295","author":"T Serra","year":"2020","unstructured":"Serra, T.: Reformulating the disjunctive cut generating linear program. Ann. Oper. Res. 295(1), 363\u2013384 (2020). https:\/\/doi.org\/10.1007\/s10479-020-03709-2","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2227_CR63","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s11590-010-0255-1","volume":"6","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Smith, J.C.: Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. Optim. Lett. 6(1), 127\u2013139 (2012). https:\/\/doi.org\/10.1007\/s11590-010-0255-1","journal-title":"Optim. Lett."},{"issue":"3","key":"2227_CR64","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/ijoc.1080.0300","volume":"21","author":"Y Yuan","year":"2009","unstructured":"Yuan, Y., Sen, S.: Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs. INFORMS J. Comput. 21(3), 480\u2013487 (2009). https:\/\/doi.org\/10.1287\/ijoc.1080.0300","journal-title":"INFORMS J. Comput."},{"issue":"1, Ser. A","key":"2227_CR65","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10107-009-0335-0","volume":"130","author":"A Zanette","year":"2011","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","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02227-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02227-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02227-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T12:21:03Z","timestamp":1768047663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02227-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,14]]},"references-count":65,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2227"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02227-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,14]]},"assertion":[{"value":"27 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}