{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:29:39Z","timestamp":1786980579440,"version":"3.56.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:00:00Z","timestamp":1169596800000},"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":[[2007,7,19]]},"DOI":"10.1007\/s10107-006-0086-0","type":"journal-article","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T11:45:09Z","timestamp":1169552709000},"page":"3-44","source":"Crossref","is-referenced-by-count":150,"title":["Valid inequalities for mixed integer linear programs"],"prefix":"10.1007","volume":"112","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,24]]},"reference":[{"key":"86_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K. Andersen","year":"2005","unstructured":"Andersen K., Cornu\u00e9jols G. and Li Y. (2005). Split closure and intersection cuts. Math. Program. A 102: 457\u2013493","journal-title":"Math. Program. A"},{"key":"86_CR2","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1287\/mnsc.1050.0382","volume":"51","author":"K. Andersen","year":"2005","unstructured":"Andersen K., Cornu\u00e9jols G. and Li Y. (2005). Reduce-and-split cuts: Improving the performance of mixed integer Gomory cuts. Manage. Sci. 51: 1720\u20131732","journal-title":"Manage. Sci."},{"key":"86_CR3","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A.: Strong formulations of robust mixed 0\u20131 programming. Math. Program. (2006)","DOI":"10.1007\/s10107-006-0709-5"},{"key":"86_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. (1971). Intersection cuts\u2014A new type of cutting planes for integer programming. Oper. Res. 19: 19\u201339","journal-title":"Oper. Res."},{"key":"86_CR5","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points, GSIA Management Science Research Report MSRR, 348, Carnegie Mellon University (1974): published as invited paper in Discrete Appl. Math. 89, 1\u201344 (1998)"},{"key":"86_CR6","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E. (1985). Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6: 466\u2013486","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"86_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S. and Cornu\u00e9jols G. (1993). A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58: 295\u2013324","journal-title":"Math. Program."},{"key":"86_CR8","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. and Natraj R.N. (1996). Gomory cuts revisited. Oper. Res. Lett. 19: 1\u20139","journal-title":"Oper. Res. Lett."},{"key":"86_CR9","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. and Jeroslow R. (1980). Strengthening cuts for mixed integer programs. Euro. J. Oper. Res. 4: 224\u2013234","journal-title":"Euro. J. Oper. Res."},{"key":"86_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas E. and Perregaard M. (2003). A Precise correspondence between lift-and-project cuts, simple disjunctive cuts and mixed integer Gomory cuts for 0-1 programming. Math. Program. B 94: 221\u2013245","journal-title":"Math. Program. B"},{"key":"86_CR11","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Tepper School of Business Management Science Research Report MSRR 674, Carnegie Mellon University (2006)"},{"key":"86_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D. Bienstock","year":"2004","unstructured":"Bienstock D. and Zuckerberg M. (2004). Subset\u00a0algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15: 63\u201395","journal-title":"SIAM J. Optim."},{"key":"86_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)"},{"key":"86_CR14","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Gu, Z., Rothberg, E., Wunderling, R.: Mixed integer programming: a progress report, In: Gr\u00f6tschel, M. (ed.) The Sharpest Cut: The Impact of Manfred Padberg and his work, MPS\/SIAM Series in Optimization pp. 309\u2013326 (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"86_CR15","unstructured":"Bonami, P.: Etude et mise en oeuvre d\u2019approches poly\u00e9driques pour la r\u00e9solution de programmes en nombres entiers ou mixtes g\u00e9n\u00e9raux, PhD Thesis, Universit\u00e9 de Paris 6 (2003)"},{"key":"86_CR16","unstructured":"Bonami, P., Cornu\u00e9jols, G.: On MIR inequalities (2006)"},{"key":"86_CR17","doi-asserted-by":"crossref","unstructured":"Bonami, P., Cornu\u00e9jols, G., Dash, S., Fischetti, M., Lodi, A.: Projected Chv\u00e1tal-Gomory cuts for mixed integer linear programs, to appear in Math. Program. (2007)","DOI":"10.1007\/s10107-006-0051-y"},{"key":"86_CR18","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P. Bonami","year":"2005","unstructured":"Bonami P. and Minoux M. (2005). Using rank-1 lift-and-project closures to generate cuts for 0\u20131 MIPs, a computational investigation. Discret. Optim. 2: 288\u2013307","journal-title":"Discret. Optim."},{"key":"86_CR19","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S. and Vandenbussche D. (2006). Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16: 726\u2013750","journal-title":"SIAM J. Optim."},{"key":"86_CR20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara A. and Letchford A.N. (2003). On the separation of split cuts and related inequalities. Math. Program. B 94: 279\u2013294","journal-title":"Math. Program. B"},{"key":"86_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V. (1973). Edmonds polytopes and a hierarchy of combinatorial optimization. Discret. Math. 4: 305\u2013337","journal-title":"Discret. Math."},{"key":"86_CR22","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114\u2013115, 455\u2013499 (1989)","DOI":"10.1016\/0024-3795(89)90476-X"},{"key":"86_CR23","doi-asserted-by":"crossref","unstructured":"Conforti, M., Wolsey, L.: Compact formulations as a union of polyhedra. CORE discussion paper, Louvain-la-Neuve (2005)","DOI":"10.2139\/ssrn.912221"},{"key":"86_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W. Cook","year":"2001","unstructured":"Cook W. and Dash S. (2001). On the matrix-cut rank of polyhedra. Math. Oper. Res. 26: 19\u201330","journal-title":"Math. Oper. Res."},{"key":"86_CR25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R. and Schrijver A. (1990). Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47: 155\u2013174","journal-title":"Math. Program."},{"key":"86_CR26","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. and Li Y. (2001). Elementary closures for integer programs. Oper. Res. Lett. 28: 1\u20138","journal-title":"Oper. Res. Lett."},{"key":"86_CR27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s101070100250","volume":"91","author":"G. Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols G. and Li Y. (2002). On the rank of mixed 0,1 polyhedra. Math. Program. A 91: 391\u2013397","journal-title":"Math. Program. A"},{"key":"86_CR28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-002-0302-5","volume":"93","author":"G. Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols G. and Li Y. (2002). A connection between cutting plane theory and the geometry of numbers. Math. Program. A 93: 123\u2013127","journal-title":"Math. Program. A"},{"key":"86_CR29","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: Separating from the MIR closure of polyhedra, presentation at the International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, 2006, paper in preparation"},{"key":"86_CR30","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand F. (1999). On the membership problem for the elementary closure of a polyhedron. Combinatorica 19: 297\u2013300","journal-title":"Combinatorica"},{"key":"86_CR31","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e1tal closure. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005, LNCS 3509, 12\u201322 (2005)","DOI":"10.1007\/11496915_2"},{"key":"86_CR32","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/moor.26.4.796.10012","volume":"26","author":"M.X. Goemans","year":"2001","unstructured":"Goemans M.X. and Tun\u00e7el L. (2001). When does the positive semidefiniteness constraint help in lifting procedures. Math. Oper. Res. 26: 796\u2013815","journal-title":"Math. Oper. Res."},{"key":"86_CR33","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X. and Williamson D.P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42: 1115\u20131145","journal-title":"J. ACM"},{"key":"86_CR34","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming. McGraw-Hill, New York pp. 269\u2013302 (1963)"},{"key":"86_CR35","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. (1969). Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2: 451\u2013558","journal-title":"Linear Algebra Appl."},{"key":"86_CR36","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory R.E. and Johnson E.L. (1972). Some continuous functions related to corner polyhedra I. Math. Program. 3: 23\u201385","journal-title":"Math. Program."},{"key":"86_CR37","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O. G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck O. and Pochet Y. (2001). Mixing mixed-integer inequalities. Math. Program. 90: 429\u2013458","journal-title":"Math. Program."},{"key":"86_CR38","unstructured":"K\u00f6ppe, M.: Louveaux, Q., Weismantel, R., Intermediate integer programming representations using value disjunctions, technical report, Department of Mathematics, University of Magdeburg (2005)"},{"key":"86_CR39","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.orl.2003.08.003","volume":"32","author":"M. K\u00f6ppe","year":"2004","unstructured":"K\u00f6ppe M. and Weismantel R. (2004). A mixed-integer Farkas lemma and some consequences. Oper. Res. Lett. 32: 207\u2013211","journal-title":"Oper. Res. Lett."},{"key":"86_CR40","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume":"2081","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre J.B. (2001). An explicit exact SDP relaxation for nonlinear 0-1 program. Lect. Notes Comput. Sci. 2081: 293\u2013303","journal-title":"Lect. Notes Comput. Sci."},{"key":"86_CR41","first-page":"345","volume":"28","author":"M. Laurent","year":"2003","unstructured":"Laurent M. (2003). A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre relaxation for 0-1 programming. SIAM J. Optim. 28: 345\u2013375","journal-title":"SIAM J. Optim."},{"key":"86_CR42","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W. and Lov\u00e1sz L. (1982). Factoring polynomials with rational coefficients. Math. Ann. 261: 515\u2013534","journal-title":"Math. Ann."},{"key":"86_CR43","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L. and Schrijver A. (1991). Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1: 166\u2013190","journal-title":"SIAM J. Optim."},{"key":"86_CR44","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand H. and Wolsey L.A. (2001). Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49: 363\u2013371","journal-title":"Oper. Res."},{"key":"86_CR45","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"A. Miller","year":"2003","unstructured":"Miller A. and Wolsey L.A. (2003). Tight formulations for some simple MIPs and convex objective IPs. Math. Program. B 98: 73\u201388","journal-title":"Math. Program. B"},{"key":"86_CR46","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. Wiley, New York"},{"key":"86_CR47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser G.L. and Wolsey L.A. (1990). A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Program. 46: 379\u2013390","journal-title":"Math. Program."},{"key":"86_CR48","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.E., Nemirovski, A.S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications, SIAM, Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"86_CR49","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.50.5.810.370","volume":"50","author":"J.H. Owen","year":"2002","unstructured":"Owen J.H. and Mehrotra S. (2002). On the value of binary expansions for general mixed-integer linear programs. Oper. Res. 50: 810\u2013819","journal-title":"Oper. Res."},{"key":"86_CR50","unstructured":"Perregaard, M.: A practical implementation of lift-and-project cuts: A computational exploration of lift-and-project cuts with XPRESS-MP, 18th ISMP, Copenhagen (2003)"},{"key":"86_CR51","unstructured":"Roy, J.-S.: Binarize and project to generate cuts for general mixed-integer programs, technical report. EDF R&D, Clamart (2006)"},{"key":"86_CR52","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"Schrijver A. (1980). On cutting planes. Ann. Discrete Math. 9: 291\u2013296","journal-title":"Ann. Discrete Math."},{"key":"86_CR53","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A. (1986). Theory of Linear and Integer Programming. Wiley, New York"},{"key":"86_CR54","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"Sherali H. and Adams W. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3: 311\u2013430","journal-title":"SIAM J. Discrete Math."},{"key":"86_CR55","doi-asserted-by":"crossref","unstructured":"Sherali, H., Adams, W.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Chap. 4, Kluwer, Norwell (1999)","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"86_CR56","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.1040.0130","volume":"30","author":"M. Van Vyve","year":"2005","unstructured":"Van Vyve M. (2005). The continuous mixing polyhedron. Math. Oper. Res. 30: 441\u2013452","journal-title":"Math. Oper. Res."},{"key":"86_CR57","unstructured":"Wolsey, L.A.: Integer Programming (1999)"},{"key":"86_CR58","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler G.M. (1995). Lectures on Polytopes. Springer, New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0086-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0086-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0086-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:02Z","timestamp":1559109002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0086-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,24]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,7,19]]}},"alternative-id":["86"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0086-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,24]]}}}