{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:08Z","timestamp":1761621128016},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T00:00:00Z","timestamp":1360886400000},"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":[[2014,6]]},"DOI":"10.1007\/s10107-013-0645-0","type":"journal-article","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T19:51:25Z","timestamp":1360785085000},"page":"199-222","source":"Crossref","is-referenced-by-count":2,"title":["Design and verify: a new scheme for generating cutting-planes"],"prefix":"10.1007","volume":"145","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,15]]},"reference":[{"key":"645_CR1","doi-asserted-by":"crossref","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\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"645_CR2","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.: Edmonds polytopes and a hierarchy of combinatorial problems. Discret. Math. 4, 305\u2013337 (1973)","journal-title":"Discret. Math."},{"key":"645_CR3","doi-asserted-by":"crossref","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 Appl. 114, 455\u2013499 (1989)","journal-title":"Linear Algebra Appl."},{"key":"645_CR4","doi-asserted-by":"crossref","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. Math. Program. 47, 11\u201318 (1990)","journal-title":"Math. Program."},{"key":"645_CR5","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., Dash, S.: On the matrix cut rank of polyhedra. Math. Oper. Res. 26, 19\u201330 (2001)","journal-title":"Math. Oper. Res."},{"key":"645_CR6","doi-asserted-by":"crossref","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. Math. Program. 58, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"645_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Corn\u00faejols","year":"2001","unstructured":"Corn\u00faejols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"645_CR8","doi-asserted-by":"crossref","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\u20131 polyhedra. Math. Program. 91, 391\u2013397 (2002)","journal-title":"Math. Program."},{"key":"645_CR9","doi-asserted-by":"crossref","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: On the Chv\u00e1tal-Gomory closure of a compact convex set. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011, Proceedings Lecture Notes in Computer Science, vol. 6655, pp. 130\u2013142. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_11"},{"key":"645_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.1110.0488","volume":"36","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory closure of strictly convex body. Math. Oper. Res. 36, 227\u2013239 (2011)","journal-title":"Math. Oper. Res."},{"key":"645_CR11","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Pokutta, S.: Design and verify: a new scheme for generating cutting-planes. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011, Proceedings Lecture Notes in Computer Science, vol. 6655, pp. 143\u2013155. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_12"},{"key":"645_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-009-0303-8","volume":"123","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Richard, J.P.P.: Some relations between facets of low- and high-dimensional group problems. Math. Program. 123, 285\u2013313 (2010)","journal-title":"Math. Program."},{"key":"645_CR13","doi-asserted-by":"crossref","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 23, 245\u2013262 (2003)","journal-title":"Combinatorica"},{"key":"645_CR14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am Math. Soc."},{"key":"645_CR15","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. Mathematical Programming: Recent Developments and Applications (1989)"},{"key":"645_CR16","doi-asserted-by":"crossref","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\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"645_CR17","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)","DOI":"10.1002\/9781118627372"},{"key":"645_CR18","unstructured":"Pokutta, S., Schulz, A.S.: Characterization of integer-free 0\/1 polytopes with maximal rank (xxxx) (submitted)"},{"key":"645_CR19","unstructured":"Pokutta, S., Schulz, A.S.: On the rank of generic cutting-plane proof systems. In: Eisenbrand, F., Shepherd, B. (eds.) Integer Programming and Combinatorial Optimization, 14th International IPCO Conference, Proceedings, Lecture Notes in Computer Science, Lausanne, Switzerland, June 9\u201311, 2010, pp. 450\u2013463. Springer, Berlin (2010)"},{"key":"645_CR20","doi-asserted-by":"crossref","unstructured":"Pokutta, S., Stauffer, G.: Lower bounds for the Chv\u00e1tal-Gomory rank in the 0\/1 cube. Oper. Res. Lett (2011) (to appear)","DOI":"10.1016\/j.orl.2011.03.001"},{"key":"645_CR21","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0645-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0645-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0645-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T14:26:18Z","timestamp":1562682378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0645-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,15]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["645"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0645-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,15]]}}}