{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T20:33:10Z","timestamp":1768077190436,"version":"3.49.0"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0167-6377(00)00067-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:13:14Z","timestamp":1027624394000},"page":"1-8","source":"Crossref","is-referenced-by-count":50,"title":["Elementary closures for integer programs"],"prefix":"10.1016","volume":"28","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(00)00067-5_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","article-title":"Intersection cuts \u2013 a new type of cutting planes for integer programming","volume":"19","author":"Balas","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB2","series-title":"Nonlinear Programming, Vol. 2","first-page":"279","article-title":"Disjunctive programming: cutting planes from logical conditions","author":"Balas","year":"1975"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB5","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Manage. Sci."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/026\/02","article-title":"Polyhedral methods for the maximum clique problem cuts","volume":"26","author":"Balas","year":"1996","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","article-title":"Strengthening cuts for mixed integer programs","volume":"4","author":"Balas","year":"1980","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB8","unstructured":"E. Balas, M. Perregaard, A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0\u20131 programming, Proceedings of the 17th International Symposium on Mathematical Programming, Atlanta, GA, 2000."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1137\/0131054","article-title":"Two rules for deriving valid inequalities for 0\u20131 problems","volume":"31","author":"Blair","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB10","unstructured":"A. Bockmayr, F. Eisenbrand, Cutting planes and the elementary closure in fixed dimension, preprint, Max-Planck-Institut f\u00fcr Informatik, Saabr\u00fccken, Germany, 1999, to appear in Math. Oper. Res., to appear."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB11","unstructured":"S. Ceria, Lift-and-project methods for mixed 0\u20131 programs, Ph.D. Dissertation, GSIA, Carnegie Mellon University, 1993."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial optimization","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB13","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB14","unstructured":"W. Cook, S. Dash, On the matrix-cut rank of polyhedra, preprint, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1999, Math. Oper. Res., to appear."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","article-title":"Chv\u00e1tal closures for mixed integer programming problems","volume":"47","author":"Cook","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","article-title":"On the membership problem for the elementary closure of a polyhedron","volume":"19","author":"Eisenbrand","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB17","unstructured":"F. Eisenbrand, A. Schulz, Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube, in: G. Cornu\u00e9jols et al. (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of the Seventh International IPCO Conference, Graz Austria, Lecture Notes in Computer Science, Vol. 1610, 1999, pp. 137\u2013150."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB18","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","article-title":"Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems","volume":"2","author":"Fulkerson","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB19","unstructured":"M. Goemans, L. Tuncel, When does the positive semidefiniteness constraint help in lifting procedures, preprint, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 2000, Math. Oper. Res., to appear."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solutions to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB21","series-title":"Combinatorial Analysis","first-page":"211","article-title":"Solving linear programming problems in integers","author":"Gomory","year":"1960"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB22","doi-asserted-by":"crossref","unstructured":"R. Gomory, An algorithm for the mixed integer problem, Technical Report RM-2597, The RAND Corporation, 1960.","DOI":"10.2307\/1910130"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB23","series-title":"Recent Advances in Mathematical Programming","first-page":"269","article-title":"An algorithm for integer solutions to linear programs","author":"Gomory","year":"1963"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting plane theory: disjunctive methods","volume":"1","author":"Jeroslow","year":"1972","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0-1 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB26","unstructured":"H. Marchand, A. Martin, R. Weismantel, L. Wolsey, Cutting planes in integer and mixed integer programming, preprint, CORE, Louvain-la-Neuve, Belgium, 1999."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB27","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","article-title":"A recursive procedure to generate all cuts for 0-1 mixed integer programs","volume":"46","author":"Nemhauser","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(00)00067-5_BIB29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","article-title":"On cutting planes","volume":"9","author":"Schrijver","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(00)00067-5_BIB30","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T22:52:14Z","timestamp":1555973534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637700000675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0167637700000675"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(00)00067-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}