{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:45:33Z","timestamp":1778589933796,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9451,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0166-218x(87)90039-4","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"25-38","source":"Crossref","is-referenced-by-count":144,"title":["On the complexity of cutting-plane proofs"],"prefix":"10.1016","volume":"18","author":[{"given":"W.","family":"Cook","sequence":"first","affiliation":[]},{"given":"C.R.","family":"Coullard","sequence":"additional","affiliation":[]},{"given":"Gy.","family":"Tur\u00e1n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90039-4_BIB1","unstructured":"L. Babai, On Lov\u00e1s'' lattice reduction and the nearest lattice point, Combinatorica, to appear."},{"key":"10.1016\/0166-218X(87)90039-4_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/sapm1977562187","article-title":"A theorem concerning the integer lattice","volume":"56","author":"Bell","year":"1977","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/0166-218X(87)90039-4_BIB3","unstructured":"S.C. Boyd and W.R. Pulleyblank, Facet generating techniques, in preparation."},{"key":"10.1016\/0166-218X(87)90039-4_BIB4","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0166-218X(87)90039-4_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(87)90039-4_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","article-title":"Edmonds polytopes and weakly hamiltonian graphs","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90039-4_BIB7","series-title":"Report No. 84326-OR","article-title":"Cutting-plane proofs and the stability number of a graph","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(87)90039-4_BIB8","series-title":"Report No. 84325-OR","article-title":"Cutting planes in combinatorics","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(87)90039-4_BIB9","series-title":"Proc. 7th ACM Symp. on the Theory of Comp uting","first-page":"83","article-title":"Feasibly constructive proofs and the prop ositional calculus","author":"Cook","year":"1975"},{"key":"10.1016\/0166-218X(87)90039-4_BIB10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative efficiency of propositional proof systems","volume":"44","author":"Cook","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0166-218X(87)90039-4_BIB11","doi-asserted-by":"crossref","unstructured":"W. Cook, A.M.H. Gerards, A. Schrijver and \u00c9. Tardos, Sensitivity theorems in integer linear programming, Math. Programming, to appear.","DOI":"10.1007\/BF01582230"},{"key":"10.1016\/0166-218X(87)90039-4_BIB12","article-title":"Propositional representation of arithmetic proofs","author":"Dowd","year":"1979"},{"key":"10.1016\/0166-218X(87)90039-4_BIB13","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\/0166-218X(87)90039-4_BIB14","series-title":"Recursive Number Theory","author":"Goodstein","year":"1957"},{"key":"10.1016\/0166-218X(87)90039-4_BIB15","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, The Ellipsoid Method and Combinatorial Optimization (Springer, Berlin, to appear)."},{"key":"10.1016\/0166-218X(87)90039-4_BIB16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0166-218X(87)90039-4_BIB17","unstructured":"J. Hastad, communicated by R. Kannan."},{"key":"10.1016\/0166-218X(87)90039-4_BIB18","series-title":"Eine Beziehung zwischen konvexen Mengen P \u2282 R2 und den Gitterbasen von Z2","author":"Helfrich","year":"1985"},{"key":"10.1016\/0166-218X(87)90039-4_BIB19","series-title":"Research Report","article-title":"Binding constraints and Helly numbers","author":"Hoffman","year":"1977"},{"key":"10.1016\/0166-218X(87)90039-4_BIB20","series-title":"15th ACM Symkp. on the Theory of Computing","first-page":"193","article-title":"Imkproved algorithms for integer programming and related lattice problems","author":"Kannan","year":"1983"},{"key":"10.1016\/0166-218X(87)90039-4_BIB21","unstructured":"R. Kannan and L. Lov\u00e1sz, to appear."},{"key":"10.1016\/0166-218X(87)90039-4_BIB22","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(87)90039-4_BIB23","unstructured":"H.W. Lenstra, Jr. and C.P. Schnorr, On the successive minima of a pair of polar lattices, to appear."},{"key":"10.1016\/0166-218X(87)90039-4_BIB24","series-title":"Report No. 85368-OR","article-title":"An algorithmic theory of numbers, graphs and convexity","author":"Lov\u00e1sz","year":"1985"},{"key":"10.1016\/0166-218X(87)90039-4_BIB25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","author":"Robinson","year":"1965","journal-title":"JACM"},{"key":"10.1016\/0166-218X(87)90039-4_BIB26","doi-asserted-by":"crossref","unstructured":"H.E. Scarf, An observation on the structure of production sets with indivisibilities, Proc. Nat. Acad. Sci. (USA) 74, 3637\u20133641.","DOI":"10.1073\/pnas.74.9.3637"},{"key":"10.1016\/0166-218X(87)90039-4_BIB27","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\/0166-218X(87)90039-4_BIB28","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0166-218X(87)90039-4_BIB29","series-title":"Report No. 355, School of Oper. Res. and Ind. Eng.","article-title":"The number of necessary constraints in an integer program: a new proof of Scarf's theorem","author":"Todd","year":"1977"},{"key":"10.1016\/0166-218X(87)90039-4_BIB30","series-title":"Structures in Constructive Mathematics and Mathematical Logic, Part II","first-page":"115","article-title":"On the complexity of derivations in the propositional calculus","author":"Tseitin","year":"1968"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:57:09Z","timestamp":1553932629000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0166218X87900394"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90039-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}