{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T20:09:21Z","timestamp":1768075761363,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T00:00:00Z","timestamp":1313107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10107-011-0483-x","type":"journal-article","created":{"date-parts":[[2011,8,11]],"date-time":"2011-08-11T04:21:09Z","timestamp":1313036469000},"page":"19-35","source":"Crossref","is-referenced-by-count":18,"title":["Generalized intersection cuts and a new cut generating paradigm"],"prefix":"10.1007","volume":"137","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Margot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,12]]},"reference":[{"key":"483_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux Q., Weismantel, R., Wolsey, L.: Cutting planes from two rows of a simplex Tableau. IPCO XII, pp. 1\u201315, Ithaca, New York (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"483_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"483_CR3","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\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"483_CR4","doi-asserted-by":"crossref","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, 165\u2013199 (2009)","journal-title":"Math. Program. Comput."},{"key":"483_CR5","doi-asserted-by":"crossref","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, 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"483_CR6","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":"483_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V. Borozan","year":"2009","unstructured":"Borozan V., Cornu\u00e9jols G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34, 538\u2013546 (2009)","journal-title":"Math. Oper. Res."},{"key":"483_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W.J. Cook","year":"1990","unstructured":"Cook W.J., Kannan R., Schrijver A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"483_CR9","unstructured":"Dey, S., Wolsey, L.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. IPCO XIII, pp. 263\u2013275, Bertinoro, Italy (2008)"},{"key":"483_CR10","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. A (2009). doi: 10.1007\/s10107-009-0300-y","DOI":"10.1007\/s10107-009-0300-y"},{"key":"483_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R. Gomory","year":"1972","unstructured":"Gomory R., Johnson E.: Some continuous functions related to corner polyhedra. Math. Program. 3, 23\u201385 (1972)","journal-title":"Math. Program."},{"key":"483_CR12","volume-title":"Convex Polytopes","author":"B. Gr\u0171nbaum","year":"1967","unstructured":"Gr\u0171nbaum B.: Convex Polytopes. Interscience Publishers, NY (1967)"},{"key":"483_CR13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"E. Johnson","year":"1974","unstructured":"Johnson E.: On the group problem for mixed integer programming. Math. Program. Study 2, 137\u2013179 (1974)","journal-title":"Math. Program. Study"},{"key":"483_CR14","first-page":"177","volume-title":"Mathematical Programming","author":"L. Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds) Mathematical Programming, pp. 177\u2013201. KTK Scientific Publishers, Tokyo (1989)"},{"key":"483_CR15","volume-title":"Strengthening Gomory Mixed-Integer Cuts: A Computational Study","author":"F. Wesselmann","year":"2009","unstructured":"Wesselmann F.: Strengthening Gomory Mixed-Integer Cuts: A Computational Study. University of Paderborn, Paderborn (2009)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0483-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0483-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0483-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:17:42Z","timestamp":1560471462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0483-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,12]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0483-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,12]]}}}