{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T22:29:28Z","timestamp":1716503368236},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"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":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00156-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"21-27","source":"Crossref","is-referenced-by-count":31,"title":["On the Chv\u00e1tal rank of polytopes in the 0\/1 cube"],"prefix":"10.1016","volume":"98","author":[{"given":"Alexander","family":"Bockmayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Hartmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00156-0_BIB1","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\/S0166-218X(99)00156-0_BIB2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","article-title":"On cutting-plane proofs in combinatorial optimization","volume":"114\/115","author":"Chv\u00e1tal","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01582230","article-title":"Sensitivity theorems in integer linear programming","volume":"34","author":"Cook","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(99)00156-0_BIB4","doi-asserted-by":"crossref","unstructured":"W. Cook, M. Hartmann, On the complexity of branch and cut methods for the traveling salesman problem, in: W. Cook, P.D. Seymour (Eds.), Polyhedral Combinatorics, DIMACS, 1990, pp. 75\u201381.","DOI":"10.1090\/dimacs\/001\/08"},{"key":"10.1016\/S0166-218X(99)00156-0_BIB5","unstructured":"A.M.H. Gerards, On cutting planes and matrices, in: W. Cook, P.D. Seymour (Eds.), Polyhedral Combinatories, DIMACS, 1990, pp. 29\u201332."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB6","unstructured":"M. Hartmann, Cutting planes and the complexity of the integer hull, Technical Report 819, School of Operations Research and Industrial Engineering, Cornell University, September 1988."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB7","unstructured":"M. Hartmann, On the Chv\u00e1tal rank of the subtour polytope for almost all graphs, Technical Report UNC\/OR\/TR-90\/24, Department of Operations Research, University of North Carolina, December 1990."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB8","doi-asserted-by":"crossref","unstructured":"M. Hartmann, M. Queyranne, Y. Wang, On the Chv\u00e1tal rank of certain inequalities, Manuscript, 1998.","DOI":"10.1007\/3-540-48777-8_17"},{"key":"10.1016\/S0166-218X(99)00156-0_BIB9","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0166-218X(99)00156-0_BIB10","unstructured":"M.W. Padberg, M. Gr\u00f6tschel, Polyhedral computations, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 307\u2013360."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB11","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\/S0166-218X(99)00156-0_BIB12","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986."},{"key":"10.1016\/S0166-218X(99)00156-0_BIB13","unstructured":"A.S. Schulz, Polytopes and Scheduling, Ph.D. Thesis, Technical University of Berlin, Berlin, Germany, 1996."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001560?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001560?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:03:23Z","timestamp":1578477803000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0166218X99001560"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00156-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}