{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:29:41Z","timestamp":1768080581643,"version":"3.49.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031327254","type":"print"},{"value":"9783031327261","type":"electronic"}],"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_20","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Monoidal Strengthening of\u00a0Simple $$\\mathcal {V}$$-Polyhedral Disjunctive Cuts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-9565","authenticated-orcid":false,"given":"Aleksandr M.","family":"Kazachkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egon","family":"Balas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"20_CR1","unstructured":"COIN-OR Branch and Cut. https:\/\/github.com\/coin-or\/Cbc"},{"key":"20_CR2","unstructured":"COIN-OR Cut Generation Library. https:\/\/github.com\/coin-or\/Cgl"},{"key":"20_CR3","unstructured":"COIN-OR Linear Programming. https:\/\/github.com\/coin-or\/Clp"},{"issue":"4","key":"20_CR4","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)","journal-title":"Oper. Res. Lett."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Math. Program., 102(3, Ser. A), 457\u2013493 (2005)","DOI":"10.1007\/s10107-004-0558-z"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2011.11.002","volume":"9","author":"E Balas","year":"2012","unstructured":"Balas, E., Qualizza, A.: Monoidal cut strengthening revisited. Discrete Optim. 9(1), 40\u201349 (2012)","journal-title":"Discrete Optim."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2013a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"20_CR8","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)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4), 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR10","unstructured":"Balas, E., Kazachkov, A.M.: $$\\cal{V} $$-polyhedral disjunctive cuts (2022). https:\/\/arxiv.org\/abs\/2207.13619"},{"key":"20_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s10107-015-0975-1"},{"key":"20_CR12","doi-asserted-by":"crossref","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, Ser. B), 221\u2013245 (2003). The Aussois 2000 Workshop in Combinatorial Optimization","DOI":"10.1007\/s10107-002-0317-y"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-013-0008-x","volume":"1","author":"E Balas","year":"2013","unstructured":"Balas, E., Qualizza, A.: Intersection cuts from multiple rows: a disjunctive programming approach. EURO J. Computat. Optim. 1(1), 3\u201349 (2013)","journal-title":"EURO J. Computat. Optim."},{"key":"20_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1007\/BF01581273"},{"issue":"9","key":"20_CR15","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)","journal-title":"Man. Sci."},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/ijoc.1100.0437","volume":"23","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: Experiments with two-row cuts from degenerate tableaux. INFORMS J. Comput. 23(4), 578\u2013590 (2011)","journal-title":"INFORMS J. Comput."},{"key":"20_CR17","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":"20_CR18","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima, 58, 12\u201315, 6 (1998)"},{"issue":"2","key":"20_CR19","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)","journal-title":"Math. Program. Comput."},{"issue":"5","key":"20_CR20","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.orl.2013.05.005","volume":"41","author":"P Bonami","year":"2013","unstructured":"Bonami, P., Conforti, M., Cornu\u00e9jols, G., Molinaro, M., Zambelli, G.: Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5), 442\u2013444 (2013)","journal-title":"Oper. Res. Lett."},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, vol. 271 of Graduate Texts in Mathematics. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"key":"20_CR22","unstructured":"CORAL. Computational Optimization Research at Lehigh. MIP instances. https:\/\/coral.ise.lehigh.edu\/data-sets\/mixed-integer-instances\/ (2020). Accessed Sept 2020"},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28(1), 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Program. 124(1\u20132, Ser. B), 143\u2013174 (2010)","DOI":"10.1007\/s10107-010-0362-x"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/ijoc.2013.0559","volume":"26","author":"SS Dey","year":"2014","unstructured":"Dey, S.S., Lodi, A., Tramontani, A., Wolsey, L.A.: On the practical strength of two-row tableau cuts. INFORMS J. Comput. 26(2), 222\u2013237 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2009.10.016","volume":"38","author":"DG Espinoza","year":"2010","unstructured":"Espinoza, D.G.: Computing with multi-row Gomory cuts. Oper. Res. Lett. 38(2), 115\u2013120 (2010)","journal-title":"Oper. Res. Lett."},{"key":"20_CR27","first-page":"1","volume":"124","author":"J Farkas","year":"1902","unstructured":"Farkas, J.: Theorie der einfachen Ungleichungen. J. Reine Angew. Math. 124, 1\u201327 (1902)","journal-title":"J. Reine Angew. Math."},{"issue":"6","key":"20_CR28","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.orl.2017.08.012","volume":"45","author":"T Fischer","year":"2017","unstructured":"Fischer, T., Pfetsch, M.E.: Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints. Oper. Res. Lett. 45(6), 556\u2013560 (2017)","journal-title":"Oper. Res. Lett."},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128(1\u20132, Ser. A), 205\u2013230 (2011)","DOI":"10.1007\/s10107-009-0300-y"},{"issue":"2","key":"20_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-018-0146-5","volume":"11","author":"R Fukasawa","year":"2019","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: The (not so) trivial lifting in two dimensions. Math. Program. Comp. 11(2), 211\u2013235 (2019)","journal-title":"Math. Program. Comp."},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Gleixner, A., et al.: MIPLIB 2017: Data-Driven compilation of the 6th mixed-integer programming library. Math. Prog. Comp., (2021)","DOI":"10.1007\/s12532-020-00194-3"},{"issue":"1","key":"20_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3(1), 23\u201385 (1972)","journal-title":"Math. Program."},{"key":"20_CR33","unstructured":"Guennebaud, G., et al.: Eigen v3. http:\/\/eigen.tuxfamily.org (2010)"},{"key":"20_CR34","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2022)"},{"key":"20_CR35","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"EL Johnson","year":"1974","unstructured":"Johnson, E.L.: On the group problem for mixed integer programming. Math. Program. Stud. 2, 137\u2013179 (1974)","journal-title":"Math. Program. Stud."},{"issue":"1","key":"20_CR36","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10898-006-9001-8","volume":"36","author":"JJ J\u00fadice","year":"2006","unstructured":"J\u00fadice, J.J., Sherali, H.D., Ribeiro, I.M., Faustino, A.M.: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints. J. Global Optim. 36(1), 89\u2013114 (2006)","journal-title":"J. Global Optim."},{"key":"20_CR37","unstructured":"Kazachkov, A.M.: Non-Recursive Cut Generation. PhD thesis, Carnegie Mellon University (2018)"},{"key":"20_CR38","unstructured":"Kazachkov, A.M., Serrano, F.: Monoidal cut strengthening. In: Prokopyev, O., Pardalos, P.M., editors, Encyclopedia of Optimization. Springer, US, Boston, MA. Under review"},{"issue":"3","key":"20_CR39","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10589-014-9690-8","volume":"59","author":"M K\u0131l\u0131n\u00e7","year":"2014","unstructured":"K\u0131l\u0131n\u00e7, M., Linderoth, J., Luedtke, J., Miller, A.: Strong-branching inequalities for convex mixed integer nonlinear programs. Comput. Optim. Appl. 59(3), 639\u2013665 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9690-8","journal-title":"Comput. Optim. Appl."},{"key":"20_CR40","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.disopt.2014.02.001","volume":"12","author":"T Kis","year":"2014","unstructured":"Kis, T.: Lift-and-project for general two-term disjunctions. Discrete Optim. 12, 98\u2013114 (2014)","journal-title":"Discrete Optim."},{"issue":"2","key":"20_CR41","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., et al.: MIPLIB 2010: mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"20_CR42","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s11081-020-09551-6","volume":"22","author":"J Kronqvist","year":"2021","unstructured":"Kronqvist, J., Misener, R.: A disjunctive cut strengthening technique for convex MINLP. Optim. Eng. 22(3), 1315\u20131345 (2021)","journal-title":"Optim. Eng."},{"key":"20_CR43","doi-asserted-by":"crossref","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 (2003)","DOI":"10.1147\/rd.471.0057"},{"issue":"2","key":"20_CR44","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)","journal-title":"Math. Program. Comput."},{"key":"20_CR45","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc, New York (1988)","DOI":"10.1002\/9781118627372"},{"issue":"1","key":"20_CR46","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for $$0$$-$$1$$ mixed integer programs. Math. Program. 46(1), 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"20_CR47","unstructured":"Perregaard, M.: Generating Disjunctive Cuts for Mixed Integer Programs. PhD thesis, Carnegie Mellon University, 9 (2003)"},{"key":"20_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45535-3_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Perregaard","year":"2001","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 348\u2013360. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_27"},{"issue":"4","key":"20_CR49","first-page":"1624","volume":"33","author":"\u00c1S Xavier","year":"2021","unstructured":"Xavier, \u00c1.S., Fukasawa, R., Poirrier, L.: Multirow intersection cuts based on the infinity norm. INFORMS J. Comput. 33(4), 1624\u20131643 (2021)","journal-title":"INFORMS J. Comput."},{"key":"20_CR50","doi-asserted-by":"publisher","unstructured":"Ziegler, G.M.: Lectures on Polytopes, vol. 152 of Graduate Texts in Mathematics. Springer-Verlag, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4613-8431-1","DOI":"10.1007\/978-1-4613-8431-1"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:30:43Z","timestamp":1684701043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}