{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:43:09Z","timestamp":1771623789969,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422259","type":"print"},{"value":"9783540455356","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45535-3_6","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:51Z","timestamp":1265917191000},"page":"71-77","source":"Crossref","is-referenced-by-count":5,"title":["On the Rank of Mixed 0,1 Polyhedra"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,21]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/B978-0-12-468650-2.50015-8","volume-title":"Nonlinear Programming","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Disjunctive programming: cutting planes from logical conditions. In: Mangasarian, O., et al. (eds.): Nonlinear Programming, Vol. 2. Academic Press, New York (1975) 279\u2013312"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics 5 (1979) 3\u201351","journal-title":"Annals of Discrete Mathematics"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu_ejols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58 (1993) 295\u2013324","journal-title":"Mathematical Programming"},{"key":"6_CR4","unstructured":"Balas, E., Perregaard, M.: A Precise correspondence between lift-and-project cuts, simple disjunctive cuts and mixed integer Gomory cuts for 0-1 programming. Management Science Research Report MSRR-631, Carnegie Mellon University (2000)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial optimization. Discrete Mathematics 4 (1973) 305\u2013337","journal-title":"Discrete Mathematics"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114\/115","author":"V. Chv\u00e1tal","year":"1989","unstructured":"Chv\u00e1tal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications 114\/115 (1989) 455\u2013499","journal-title":"Linear Algebra and its Applications"},{"key":"6_CR7","volume-title":"Combinatorial Optimization","author":"W. Cook","year":"1998","unstructured":"Cook, W., Cunningham, W., Pullyblank, W., and Schrijver, A.: Combinatorial Optimization. John Wiley, New York (1998)."},{"key":"6_CR8","unstructured":"Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. preprint, Department of Computational and Applied Mathematics, Rice University, Houston, Texas (1999), to appear in Mathematics of Operations Research."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming 47 (1990) 155\u2013174","journal-title":"Mathematical Programming"},{"key":"6_CR10","doi-asserted-by":"publisher","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. Operations Research Letters 28 (2001) 1\u20138","journal-title":"Operations Research Letters"},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-48777-8_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F., Schulz, A.: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube. In: Cornu_ejols, G., et al, (eds.): Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 1610 (1999) 137\u2013150"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Goemans, M., Tuncel, L.: When does the positive semidefiniteness constraint help in lifting procedures. preprint, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada (2000), to appear in Mathematics of Operations Research.","DOI":"10.1287\/moor.26.4.796.10012"},{"key":"6_CR13","unstructured":"Gomory, R.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation (1960)"},{"key":"6_CR14","unstructured":"Li, Y.: Bounds on the ranks of polytopes in the 0\/1-cube. research report, Carnegie Mellon University (2000), submitted."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal of Optimization 1 (1991) 166\u2013190","journal-title":"SIAM Journal of Optimization"},{"key":"6_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley and Sons, New York (1988)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. Nemhauser","year":"1990","unstructured":"Nemhauser, G., Wolsey, L.: A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379\u2013390","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45535-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T23:32:58Z","timestamp":1711236778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45535-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422259","9783540455356"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45535-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}