{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:19Z","timestamp":1761888799844,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-013-0008-x","type":"journal-article","created":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T12:08:37Z","timestamp":1364990917000},"page":"3-49","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Intersection cuts from multiple rows: a disjunctive programming approach"],"prefix":"10.1016","volume":"1","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Qualizza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-013-0008-x_CR1","doi-asserted-by":"crossref","unstructured":"Andersen K, Louveaux Q, Weismantel R, Wolsey LA (2007) Cutting planes from two rows of a simplex tableau. In: IPCO 12, Lecture notes in computer science, vol 4513. Springer, Berlin, pp 1\u201315","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"10.1007\/s13675-013-0008-x_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","article-title":"Intersection cuts\u2014a new type of cutting planes for integer programming","volume":"19","author":"Balas","year":"1971","journal-title":"Oper Res"},{"key":"10.1007\/s13675-013-0008-x_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","article-title":"Disjunctive programming: properties of the convex hull of feasible points","volume":"89","author":"Balas","year":"1998","journal-title":"Discret Appl Math"},{"key":"10.1007\/s13675-013-0008-x_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann Discret Math"},{"key":"10.1007\/s13675-013-0008-x_CR5","unstructured":"Balas E (2009a) Intersection cuts from maximal lattice-free convex sets and lift-and-project cuts from multiple-term disjunctions. American Mathematical Society Western Section Spring Meeting, San Francisco, April, pp 25\u201327"},{"key":"10.1007\/s13675-013-0008-x_CR6","unstructured":"Balas E (2009b) Multiple-term disjunctive cuts and intersection cuts from multiple rows of the simplex tableau. In: 20th international symposium on mathematical programming, Chicago, August 23\u201328, 2009"},{"key":"10.1007\/s13675-013-0008-x_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0-1 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0008-x_CR8","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0-1 programming by lift-and-project in a branch-and-cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-013-0008-x_CR9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","article-title":"Strengthening cuts for mixed integer programs","volume":"4","author":"Balas","year":"1980","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-013-0008-x_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","article-title":"A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming","volume":"94","author":"Balas","year":"2003","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0008-x_CR11","first-page":"1220","article-title":"On the relative strength of split triangle and quadrilateral cuts","volume":"126","author":"Basu","year":"2009","journal-title":"Math Program"},{"issue":"4","key":"10.1007\/s13675-013-0008-x_CR12","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/ijoc.1100.0437","article-title":"Experiments with Two-Row Cuts from Degenerate Tableaux","volume":"23","author":"Basu","year":"2010","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-013-0008-x_CR13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","article-title":"Minimal valid inequalities for integer constraints","volume":"34","author":"Borozan","year":"2009","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-013-0008-x_CR14","unstructured":"COmputational INfrastructure for Operations Research (COIN-OR) (2000) http:\/\/www.coin-or.org"},{"key":"10.1007\/s13675-013-0008-x_CR15","first-page":"105","article-title":"Corner polyhedron and intersection cuts","volume":"16","author":"Conforti","year":"2011","journal-title":"Surv Oper Res Manag Sci"},{"key":"10.1007\/s13675-013-0008-x_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","article-title":"Chvatal closures for mixed integer programming problems","volume":"47","author":"Cook","year":"1990","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0008-x_CR17","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10107-008-0221-1","article-title":"On the facets of mixed integer programs with two integer variables and two constraints","volume":"120","author":"Cornu\u00e9jols","year":"2009","journal-title":"Mathe Program A"},{"key":"10.1007\/s13675-013-0008-x_CR18","doi-asserted-by":"crossref","unstructured":"Dash S, Dey S, Gunluk O (2010) Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math Program A. doi:10.1007\/s\/0\/07-011-0455-1","DOI":"10.1007\/s10107-011-0455-1"},{"key":"10.1007\/s13675-013-0008-x_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","article-title":"Two row mixed-integer cuts via lifting","volume":"124","author":"Dey","year":"2010","journal-title":"Math Program B"},{"key":"10.1007\/s13675-013-0008-x_CR20","doi-asserted-by":"crossref","unstructured":"Dey S, Lodi A, Tramontani A, Wolsey L (2010) Experiments with two-row tableau cuts. In: IPCO 14, Lecture notes in computer science, vol 6080. Springer, 2010, pp 424\u2013437. doi:10.1007\/978-3-642-13036-6","DOI":"10.1007\/978-3-642-13036-6_32"},{"key":"10.1007\/s13675-013-0008-x_CR21","unstructured":"Gomory RE (1960) An algorithm for the mixed integer problem. RM-2597. The Rand Corporation"},{"key":"10.1007\/s13675-013-0008-x_CR22","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"J Linear Algebra Appl"},{"key":"10.1007\/s13675-013-0008-x_CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BFb0120692","article-title":"On the group problem for mixed integer programming","volume":"3","author":"Johnson","year":"1974","journal-title":"Math Program Study"},{"key":"10.1007\/s13675-013-0008-x_CR24","unstructured":"Margot F (2010) MIPLIB3-C-V2.http:\/\/wpweb2.tepper.cmu.edu\/fmargot\/MPS\/miplib3-c-v2.tar.gz"},{"key":"10.1007\/s13675-013-0008-x_CR25","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12532-009-0003-7","article-title":"Testing cut generators for Mixed-Integer Linear Programming","volume":"1","author":"Margot","year":"2009","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-013-0008-x_CR26","unstructured":"MIPLIB 3 (1996) Available at http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib3.html"},{"key":"10.1007\/s13675-013-0008-x_CR27","unstructured":"Qualizza A (2011) Cutting planes for mixed integer programming. Dissertation, Tepper School of Business, Carnegie Mellon University"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0008-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0008-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0008-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:55Z","timestamp":1761882355000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000101"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0008-x","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Intersection cuts from multiple rows: a disjunctive programming approach","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0008-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}