{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:41Z","timestamp":1725586841999},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_12","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"143-155","source":"Crossref","is-referenced-by-count":1,"title":["Design and Verify: A New Scheme for Generating Cutting-Planes"],"prefix":"10.1007","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed integer 0-1 programs. Mathematical Programming\u00a058, 295\u2013324 (1993)","journal-title":"Mathematical Programming"},{"key":"12_CR2","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 problems. Discrete Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114","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\u00a0114, 455\u2013499 (1989)","journal-title":"Linear Algebra and its Applications"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01580849","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook, W., Coullard, C.R., Turan, G.: On the complexity of cutting plane proof. Mathematical Programming\u00a047, 11\u201318 (1990)","journal-title":"Mathematical Programming"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W. Cook","year":"2001","unstructured":"Cook, W., Dash, S.: On the matrix cut rank of polyhedra. Mathematics of Operations Research\u00a026, 19\u201330 (2001)","journal-title":"Mathematics of Operations Research"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"58","author":"W. Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming\u00a058, 155\u2013174 (1990)","journal-title":"Mathematical Programming"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s101070100250","volume":"91","author":"G. Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols, G., Li, Y.: On the rank of mixed 0-1 polyhedra. Mathematical Programming\u00a091, 391\u2013397 (2002)","journal-title":"Mathematical Programming"},{"key":"12_CR8","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory Closure of Strictly Convex Body (2010), \n                  \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2010\/05\/2608.html"},{"key":"12_CR9","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (2010), \n                  \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2010\/03\/2582.html"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"S.S. Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed integer cuts via lifting. Mathematical Programming\u00a0124, 143\u2013174 (2010)","journal-title":"Mathematical Programming"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00493-003-0020-5","volume":"23","author":"F. Eisenbrand","year":"2003","unstructured":"Eisenbrand, F., Schulz, A.S.: Bounds on the Chv\u00e1tal rank of polytopes in the 0\/1-cube. Combinatorica\u00a023, 245\u2013262 (2003)","journal-title":"Combinatorica"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"12_CR13","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for solving convex programs. Journal of the SIAM\u00a08, 703\u2013712 (1960)","journal-title":"Journal of the SIAM"},{"key":"12_CR14","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 on Optimization\u00a01, 166\u2013190 (1991)","journal-title":"SIAM Journal on Optimization"},{"key":"12_CR15","doi-asserted-by":"publisher","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 Interscience, Hoboken (1988)"},{"key":"12_CR16","unstructured":"Pokutta, S., Schulz, A.S.: Characterization of integer-free 0\/1 polytopes with maximal rank, working paper"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-13036-6_34","volume-title":"Integer Programming and Combinatorial Optimization","author":"S. Pokutta","year":"2010","unstructured":"Pokutta, S., Schulz, A.S.: On the rank of generic cutting-plane proof systems. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 450\u2013463. Springer, Heidelberg (2010)"},{"key":"12_CR18","unstructured":"Pokutta, S., Stauffer, G.: A new lower bound technique for the Gomory-Chv\u00e1tal procedure (2010), \n                  \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2010\/09\/2748.html"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:05:26Z","timestamp":1553810726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}