{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:18:08Z","timestamp":1761895088220},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T00:00:00Z","timestamp":1274140800000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0362-x","type":"journal-article","created":{"date-parts":[[2010,5,17]],"date-time":"2010-05-17T01:06:25Z","timestamp":1274058385000},"page":"143-174","source":"Crossref","is-referenced-by-count":43,"title":["Two row mixed-integer cuts via lifting"],"prefix":"10.1007","volume":"124","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,18]]},"reference":[{"key":"362_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Cutting planes from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 1\u201315. Springer (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"362_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10107-003-0390-x","volume":"96","author":"J. Ar\u00e1oz","year":"2003","unstructured":"Ar\u00e1oz J., Evans L., Gomory R.E., Johnson E.L.: Cyclic group and knapsack facets. Math. Prog. 96, 377\u2013408 (2003)","journal-title":"Math. Prog."},{"key":"362_CR3","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. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"key":"362_CR4","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":"362_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.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"362_CR6","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. http:\/\/integer.tepper.cmu.edu (2007)"},{"key":"362_CR7","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. Prog. 47, 155\u2013174 (1990)","journal-title":"Math. Prog."},{"key":"362_CR8","doi-asserted-by":"crossref","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\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"362_CR9","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. To appear in Math. Prog. (2008)","DOI":"10.1007\/s10107-008-0221-1"},{"key":"362_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1287\/ijoc.15.4.385.24893","volume":"15","author":"G. Cornu\u00e9jols","year":"2003","unstructured":"Cornu\u00e9jols G., Li Y., Vandenbussche D.: K-cuts: a variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15, 385\u2013396 (2003)","journal-title":"INFORMS J. Comput."},{"key":"362_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S. Dash","year":"2006","unstructured":"Dash S., G\u00fcnl\u00fck O.: Valid inequalities based on simple mixed-integer sets. Math. Prog. 105, 29\u201353 (2006)","journal-title":"Math. Prog."},{"key":"362_CR12","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On the strength of Gomory mixed-integer cuts as group cuts. Technical Report RC23967, IBM Research report (2006b)","DOI":"10.1007\/s10107-007-0179-4"},{"key":"362_CR13","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Richard, J.-P.P.: Sequential-merge facets for two-dimensional group problems. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 30\u201342. Springer (2007)","DOI":"10.1007\/978-3-540-72792-7_3"},{"key":"362_CR14","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/moor.1070.0283","volume":"33","author":"S.S. Dey","year":"2008","unstructured":"Dey S.S., Richard J.-P.P.: Facets of two-dimensional infinite group problems. Math. Oper. Res. 33, 140\u2013166 (2008)","journal-title":"Math. Oper. Res."},{"key":"362_CR15","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesci, A., Rinaldi, G. (eds.) Proceedings 13th Conference on Integer Programming and Combinatorial Optimization, pp. 463\u2013475. Springer (2007)","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"362_CR16","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed integer cuts via lifting. Technical Report 30, CORE DP, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium (2008)"},{"key":"362_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-006-0726-4","volume":"109","author":"M. Fischetti","year":"2007","unstructured":"Fischetti M., Saturni C.: Mixed integer cuts from cyclic groups. Math. Prog. 109, 27\u201353 (2007)","journal-title":"Math. Prog."},{"key":"362_CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"Gomory R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2, 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"362_CR19","unstructured":"Gomory, R.E.: An algorithm for the mixed-integer problem. Technical Report RM-2597, Rand Report (1960)"},{"key":"362_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory R.E., Johnson E.L.: Some continuous functions related to corner polyhedra, part I. Math. Prog. 3, 23\u201385 (1972)","journal-title":"Math. Prog."},{"key":"362_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory R.E., Johnson E.L.: Some continuous functions related to corner polyhedra, part II. Math. Prog. 3, 359\u2013389 (1972)","journal-title":"Math. Prog."},{"key":"362_CR22","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10107-003-0389-3","volume":"96","author":"R.E. Gomory","year":"2003","unstructured":"Gomory R.E., Johnson E.L.: T-space and cutting planes. Math. Prog. 96, 341\u2013375 (2003)","journal-title":"Math. Prog."},{"key":"362_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-003-0388-4","volume":"96","author":"R.E. Gomory","year":"2003","unstructured":"Gomory R.E., Johnson E.L., Evans L.: Corner polyhedra and their connection with cutting planes. Math. Prog. 96, 321\u2013339 (2003)","journal-title":"Math. Prog."},{"key":"362_CR24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"E.L. Johnson","year":"1974","unstructured":"Johnson E.L.: On the group problem for mixed integer programming. Math. Prog. Study 2, 137\u2013179 (1974)","journal-title":"Math. Prog. Study"},{"key":"362_CR25","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0120925","volume":"14","author":"E.L. Johnson","year":"1981","unstructured":"Johnson E.L.: Characterization of facets for multiple right-hand choice linear programs. Math. Prog. Study 14, 112\u2013142 (1981)","journal-title":"Math. Prog. Study"},{"key":"362_CR26","volume-title":"Mathematical Programming: Recent Developments and Applications","author":"L. Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds) Mathematical Programming: Recent Developments and Applications, Kluwer, Dordrecht (1989)"},{"key":"362_CR27","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1002\/nav.20275","volume":"55","author":"L.A. Miller","year":"2008","unstructured":"Miller L.A., Li Y., Richard J.-P.P.: New facets for finite and infinite group problems from approximate lifting. Naval Res. Logis. 55, 172\u2013191 (2008)","journal-title":"Naval Res. Logis."},{"key":"362_CR28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser G.L., Wolsey L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Prog. 46, 379\u2013390 (1990)","journal-title":"Math. Prog."},{"key":"362_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"362_CR30","doi-asserted-by":"crossref","unstructured":"Richard, J.-P.P., Li, Y., Miller, L.A.: Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Prog. 118, 253\u2013277 (2009)","DOI":"10.1007\/s10107-007-0190-9"},{"key":"362_CR31","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"G.T. Rockafeller","year":"1970","unstructured":"Rockafeller G.T.: Convex Analysis. Princeton University Press, New Jersey, NJ (1970)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0362-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0362-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0362-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T21:10:18Z","timestamp":1635369018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0362-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,18]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0362-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,18]]}}}