{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:26:38Z","timestamp":1768080398832,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,25]],"date-time":"2014-09-25T00:00:00Z","timestamp":1411603200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s12532-014-0076-9","type":"journal-article","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T04:46:25Z","timestamp":1411533985000},"page":"113-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The strength of multi-row models"],"prefix":"10.1007","volume":"7","author":[{"given":"Quentin","family":"Louveaux","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Poirrier","sequence":"additional","affiliation":[]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,25]]},"reference":[{"issue":"4","key":"76_CR1","doi-asserted-by":"crossref","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":"76_CR2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10107-010-0376-4","volume":"124","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: Mixed-integer sets from two rows of two adjacent simplex bases. Math. Program. 124, 455\u2013480 (2010)","journal-title":"Math. Program."},{"key":"76_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 4513, pp. 1\u201315. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"76_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-45586-8_7","volume":"2241","author":"D Applegate","year":"2001","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. Lect. Notes Comput. Sci. 2241, 261\u2013303 (2001)","journal-title":"Lect. Notes Comput. Sci."},{"key":"76_CR5","unstructured":"Atamt\u00fcrk, A.: http:\/\/ieor.berkeley.edu\/~atamturk\/data\/"},{"issue":"3","key":"76_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52(3), 487\u2013490 (2004)","journal-title":"Oper. Res."},{"issue":"19","key":"76_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"1","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 1(19), 19\u201339 (1971)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"76_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift-and-project for mixed 0\u20131 programming: recent progress. Discrete Appl. Math. 123(1\u20133), 129\u2013154 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"76_CR9","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. 94(2\u20133), 221\u2013245 (2003)","journal-title":"Math. Program."},{"key":"76_CR10","doi-asserted-by":"crossref","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, 578\u2013590 (2011)","journal-title":"INFORMS J. Comput."},{"key":"76_CR11","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/090756375","volume":"24","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Giacomo, Z.: Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discrete Math. 24, 158\u2013168 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"76_CR12","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., Molinaro, M.: A probabilistic analysis of the strength of the split and triangle closures. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization. Lecture Notes in Computer Science, vol. 6655, pp. 27\u201338. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_3"},{"key":"76_CR13","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 (1998)"},{"issue":"4","key":"76_CR14","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"AE Boyd","year":"1993","unstructured":"Boyd, A.E.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3(4), 734\u2013750 (1993)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"76_CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s12532-013-0052-9","volume":"5","author":"V Chv\u00e1tal","year":"2013","unstructured":"Chv\u00e1tal, V., Cook, W., Espinoza, D.: Local cuts for mixed-integer programming. Math. Program. Comput. 5(2), 171\u2013200 (2013)","journal-title":"Math. Program. Comput."},{"key":"76_CR16","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: A geometric perspective on lifting. Oper. Res. 59, 569\u2013577 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"76_CR17","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10107-008-0221-1","volume":"120","author":"G Cornu\u00e9jols","year":"2009","unstructured":"Cornu\u00e9jols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Math. Program. 120(2), 429\u2013456 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"76_CR18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-011-0455-1","volume":"135","author":"S Dash","year":"2012","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135(1\u20132), 221\u2013254 (2012)","journal-title":"Math. Program."},{"issue":"3\u20134","key":"76_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s12532-010-0018-0","volume":"2","author":"S Dash","year":"2010","unstructured":"Dash, S., Goycoolea, M.: A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3\u20134), 231\u2013257 (2010)","journal-title":"Math. Program. Comput."},{"key":"76_CR20","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. IBM Technical Report (2011)"},{"key":"76_CR21","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Program. 124, 143\u2013174 (2010)","DOI":"10.1007\/s10107-010-0362-x"},{"key":"76_CR22","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Lodi, A., Tramontani, A., Wolsey, L.A.: Experiments with two row tableau cuts. In: Eisenbrand, F., Bruce Shepherd, F. (eds.) Integer Programming and Combinatorial Optimization. Proceedings of the 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9\u201311, 2010. Lecture Notes in Computer Science, vol. 6080, pp. 424\u2013437. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13036-6_32"},{"issue":"2","key":"76_CR23","doi-asserted-by":"crossref","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":"3","key":"76_CR24","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/moor.1110.0496","volume":"36","author":"SS Dey","year":"2011","unstructured":"Dey, S.S., Louveaux, Q.: Split rank of triangle and quadrilateral inequalities. Math. Oper. Res. 36(3), 432\u2013461 (2011)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"76_CR25","first-page":"137","volume":"21","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Richard, J.-P.P.: Linear-programming-based lifting and its application to primal cutting-plane algorithms. INFORMS J. Comput. 21(1), 137\u2013150 (2010)","journal-title":"INFORMS J. Comput."},{"key":"76_CR26","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., Panconesi, A., Rinaldi, G. (eds.) Integer Programming and Combinatorial Optimization. Proccedings of the13th International Conference, IPCO 2008, Bertinoro, Italy, May 26\u201328, 2008. Lecture Notes in Computer Science, vol. 5035, pp. 463\u2013475. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"76_CR27","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. CORE Discussion Papers 2009033, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2009)"},{"issue":"2","key":"76_CR28","doi-asserted-by":"crossref","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":"76_CR29","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12532-011-0024-x","volume":"3","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Salvagnin, D.: A relax-and-cut framework for gomory\u2019s mixed-integer cuts. Math. Program. Comput. 3, 79\u2013102 (2011)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"76_CR30","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1287\/ijoc.1120.0543","volume":"25","author":"M Fischetti","year":"2013","unstructured":"Fischetti, M., Salvagnin, D.: Approximating the split closure. INFORMS J. Comput. 25(4), 808\u2013819 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"76_CR31","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.disopt.2010.09.002","volume":"8","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., G\u00fcnl\u00fck, O.: Strengthening lattice-free cuts using non-negativity. Discrete Optim. 8(2), 229\u2013245 (2011)","journal-title":"Discrete Optim."},{"key":"76_CR32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10107-009-0284-7","volume":"128","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., Goycoolea, M.: On the exact separation of mixed integer knapsack cuts. Math. Program. 128, 19\u201341 (2011)","journal-title":"Math. Program."},{"key":"76_CR33","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"RE Gomory","year":"1965","unstructured":"Gomory, R.E.: On the relation between integer and noninteger solutions to linear programs. Proc. Natl. Acad. Sci. 53, 260\u2013265 (1965)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"76_CR34","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"76_CR35","doi-asserted-by":"crossref","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, part I. Math. Program. 3, 23\u201385 (1972)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"76_CR36","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10107-012-0597-9","volume":"143","author":"Q Louveaux","year":"2014","unstructured":"Louveaux, Q., Poirrier, L.: An algorithm for the separation of two-row cuts. Math. Program. 143(1\u20132), 111\u2013146 (2014)","journal-title":"Math. Program."},{"key":"76_CR37","unstructured":"Margot, F.: MIPLIB3 C V2. http:\/\/wpweb2.tepper.cmu.edu\/fmargot\/ (2009)"},{"key":"76_CR38","doi-asserted-by":"crossref","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\u20131 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"76_CR39","doi-asserted-by":"crossref","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Aardal, K., Gerards, B. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 2081, pp. 348\u2013360. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45535-3_27"},{"key":"76_CR40","unstructured":"Poirrier, L.: Multi-row approaches to cutting plane generation. PhD thesis, University of Li\u00e8ge (2012)"},{"issue":"1\u20133","key":"76_CR41","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J-PP Richard","year":"2003","unstructured":"Richard, J.-P.P., de Farias Jr, I.R., Nemhauser, G.L.: Lifted inequalities for 0\u20131 mixed integer programming: basic theory and algorithms. Math. Program. 98(1\u20133), 89\u2013113 (2003)","journal-title":"Math. Program."},{"key":"76_CR42","volume-title":"Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0076-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0076-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0076-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T09:39:36Z","timestamp":1565861976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0076-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,25]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0076-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,25]]}}}