{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:14:30Z","timestamp":1768079670174,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T00:00:00Z","timestamp":1252540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s12532-009-0006-4","type":"journal-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T10:30:29Z","timestamp":1252492229000},"page":"165-199","source":"Crossref","is-referenced-by-count":26,"title":["Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants"],"prefix":"10.1007","volume":"1","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Bonami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"6_CR2","volume-title":"Generating Deepest Mixed Integer Cuts by Disjunctive Modularization","author":"E. Balas","year":"2002","unstructured":"Balas E.: Generating Deepest Mixed Integer Cuts by Disjunctive Modularization. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA (2002)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E., Bonami, P.: New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. In: Fischetti, M., Williamson, D. (eds.) Integer Programming and Combinatorial Optimization (IPCO 12), Lecture Notes in Computer Science, vol. 4513, pp. 89\u2013104. Springer, New York (2007)","DOI":"10.1007\/978-3-540-72792-7_8"},{"key":"6_CR4","doi-asserted-by":"crossref","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, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"112","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. Manag. Sci. 112, 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G., Natraj: Gomory cuts revisited. Oper. Res. Lett. 19, 1\u201310 (1996)","journal-title":"Oper. Res. Lett."},{"key":"6_CR7","doi-asserted-by":"crossref","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\u20131 programming. Math. Program. B. 94, 221\u2013245 (2003)","journal-title":"Math. Program. B."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E. Balas","year":"2008","unstructured":"Balas E., Saxena A.: Optimizing over the split closure. Math. Program. A. 113, 219\u2013240 (2008)","journal-title":"Math. Program. A."},{"key":"6_CR9","unstructured":"COIN-OR website: http:\/\/www.coin-or.org\/"},{"key":"6_CR10","unstructured":"CglLandP: https:\/\/projects.coin-or.org\/Cgl\/wiki\/CglLandP"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-008-0225-x","volume":"121","author":"S. Dash","year":"2009","unstructured":"Dash S., Gunluk O., Lodi A.: MIR closures of polyhedral sets. Math. Program. A. 121, 33\u201360 (2009)","journal-title":"Math. Program. A."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Tramontani: On the separation of disjunctive cuts. Math. Program. A. (2009), to appear","DOI":"10.1007\/s10107-009-0300-y"},{"key":"6_CR13","unstructured":"Perregaard, M.: A practical implementation of lift-and-project cuts. International Symposium on Mathematical Programming, Copenhagen (2003)"},{"key":"6_CR14","unstructured":"Perregaard, M.: Generating disjunctive cuts for mixed integer programs. Ph.D. Thesis, Carnegie Mellon University (2003)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-009-0006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-009-0006-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-009-0006-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:56Z","timestamp":1559477756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-009-0006-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,10]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s12532-009-0006-4","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,10]]}}}