{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:09:34Z","timestamp":1743124174115,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030727"},{"type":"electronic","value":"9783642030734"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03073-4_15","type":"book-chapter","created":{"date-parts":[[2009,7,14]],"date-time":"2009-07-14T08:06:17Z","timestamp":1247558777000},"page":"134-143","source":"Crossref","is-referenced-by-count":0,"title":["Cutting Planes and the Parameter Cutwidth"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dantchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ben-sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. Journal of the ACM, 517\u2013526 (1999)","DOI":"10.1145\/301250.301392"},{"issue":"1-2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0166-218X(99)00156-0","volume":"98","author":"A. Bockmayr","year":"1999","unstructured":"Bockmayr, A., Eisenbrand, F., Hartmann, M., Schulz, A.S.: On the Chv\u00e1tal rank of polytopes in the 0\/1 cube. Discrete Appl. Math.\u00a098(1-2), 21\u201327 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.4086\/toc.2006.v002a004","volume":"2","author":"J. Buresh-Oppenheim","year":"2006","unstructured":"Buresh-Oppenheim, J., Galesi, N., Hoory, S., Magen, A., Pitassi, T.: Rank bounds and integrality gaps for cutting planes procedures. Theory of Computing\u00a02(4), 65\u201390 (2006)","journal-title":"Theory of Computing"},{"key":"15_CR4","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 Math.\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W. Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math.\u00a018(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/1250790.1250837","volume-title":"STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","author":"S.S. Dantchev","year":"2007","unstructured":"Dantchev, S.S.: Rank complexity gap for Lov\u00e1sz-Schrijver and Sherali-Adams proof systems. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 311\u2013317. ACM Press, New York (2007)"},{"issue":"2","key":"15_CR7","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, S.: Bounds on the chv\u00e1tal rank of polytopes in the 0\/1-cube. Combinatorica\u00a023(2), 245\u2013261 (2003)","journal-title":"Combinatorica"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, Providence, RI, vol.\u00a010 (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"15_CR9","first-page":"269","volume-title":"Recent advances in mathematical programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Recent advances in mathematical programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00037-001-8194-y","volume":"10","author":"S. Riis","year":"2001","unstructured":"Riis, S.: A complexity gap for tree resolution. Computational Complexity\u00a010(3), 179\u2013209 (2001)","journal-title":"Computational Complexity"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/LICS.2008.30","volume-title":"Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008)","author":"S. Riis","year":"2008","unstructured":"Riis, S.: On the asymptotic nullstellensatz and polynomial calculus proof complexity. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pp. 272\u2013283. IEEE Computer Society Press, Los Alamitos (2008)"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math.\u00a03(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Theory and Computational Practice"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03073-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T15:13:46Z","timestamp":1633706026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03073-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030727","9783642030734"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03073-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}