{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:41:44Z","timestamp":1725892904267},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_17","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T08:43:11Z","timestamp":1172824991000},"page":"218-233","source":"Crossref","is-referenced-by-count":6,"title":["On the Chv\u00e1tal Rank of Certain Inequalities"],"prefix":"10.1007","author":[{"given":"Mark","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Queyranne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaoguang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols (1993), \u201cA lift-and-project cutting plane algorithm for mixed 0\u20131 programs,\u201d Mathematical Programming 58, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0166-218X(89)90014-0","volume":"23","author":"E. Balas","year":"1989","unstructured":"E. Balas and M.J. Saltzman (1989), \u201cFacets of the three-index assignment polytope,\u201d Discrete Applied Mathematics 23, 201\u2013229.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR3","unstructured":"A. Bockmayr, F. Eisenbrand, M. Hartmann and A.S. Schulz (to appear), \u201cOn the Chv\u00e1tal rank of polytopes in the 0\/1 cube,\u201d to appear in Discrete Applied Mathematics."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/moor.16.2.259","volume":"16","author":"S.C. Boyd","year":"1991","unstructured":"S.C. Boyd and W.H. Cunningham (1991), \u201cSmall travelling salesman polytopes,\u201d Mathematics of Operations Research 16, 259\u2013271.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0805020","volume":"5","author":"S.C. Boyd","year":"1995","unstructured":"S.C. Boyd, W.H. Cunningham, M. Queyranne and Y. Wang (1995), \u201cLadders for travelling salesmen,\u201d SIAM Journal on Optimization 5, 408\u2013420.","journal-title":"SIAM Journal on Optimization"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01588786","volume":"49","author":"S.C. Boyd","year":"1991","unstructured":"S.C. Boyd and W.R. Pulleyblank (1991), \u201cOptimizing over the subtour polytope of the travelling salesman problem,\u201d Mathematical Programming 49, 163\u2013187.","journal-title":"Mathematical Programming"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0025-5610(96)00003-2","volume":"74","author":"A. Caprara","year":"1996","unstructured":"A. Caprara and M. Fischetti (1996), \u201c0\u20131\/2 Chv\u00e1tal-Gomory cuts,\u201d Mathematical Programming 74, 221\u2013236.","journal-title":"Mathematical Programming"},{"key":"17_CR8","series-title":"DEIS-OR Technical Report","volume-title":"On the separation of maximally violated mod-k cuts","author":"A. Caprara","year":"1997","unstructured":"A. Caprara, M. Fischetti and A.N. Letchford (1997), \u201cOn the separation of maximally violated mod-k cuts,\u201d DEIS-OR Technical Report OR-97-8, Dipartimento di Elettronica, Informatica e Sistemistica Universit\u00e0 degli Studi di Bologna, Italy, May 1997."},{"key":"17_CR9","unstructured":"S. Ceria (1993), \u201cLift-and-project methods for mixed 0\u20131 programs,\u201d Ph.D. dissertation, Carnegie-Mellon University."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal (1973), \u201cEdmonds polytopes and a hierarchy of combinatorial problems,\u201d Discrete Mathematics 4, 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114\/115","author":"V. Chv\u00e1tal","year":"1989","unstructured":"V. Chv\u00e1tal, W. Cook and M. Hartmann (1989), \u201cOn cutting-plane proofs in combinatorial optimization,\u201d Linear Algebra and Its Applications 114\/115, 455\u2013499.","journal-title":"Linear Algebra and Its Applications"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/moor.12.1.50","volume":"12","author":"P.D. Domich","year":"1987","unstructured":"P.D. Domich, R. Kannan and L.E. Trotter, Jr. (1987), \u201cHermite normal form computation using modulo determinant arithmetic,\u201d Mathematics of Operations Research 12, 50\u201359.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579233","volume":"2","author":"J. Edmonds","year":"1982","unstructured":"J. Edmonds, L. Lov\u00e1sz and W.R. Pulleyblank (1982), \u201cBrick decompositions and the matching rank of graphs,\u201d Combinatorica 2, 247\u2013274.","journal-title":"Combinatorica"},{"key":"17_CR14","volume-title":"A note on the membership problem for the elementary closure of a polyhedron","author":"F. Eisenbrand","year":"1998","unstructured":"F. Eisenbrand (1998), \u201cA note on the membership problem for the elementary closure of a polyhedron,\u201d Preprint TU-Berlin No. 605\/1998, Fachbereich Mathematik, Technische Universit\u00e4t Berlin, Germany, November 1998."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"F. Eisenbrand and A.S. Schulz (1999), \u201cBounds on the Chv\u00e1tal Rank of Polytopes in the 0\/1-Cube\u201d, this Volume.","DOI":"10.1007\/3-540-48777-8_11"},{"key":"17_CR16","unstructured":"M. Fischetti (1992), \u201cThree facet-lifting theorems for the asymmetric traveling salesman polytope\u201d, pp. 260\u2013273 in E. Balas, G. Cornu\u00e9jols and R. Kannan, eds, Integer Programming and Combinatorial Optimization (Proceedings of the IPCO2 Conference), G.S.I.A, Carnegie Mellon University."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0166-218X(93)E0082-A","volume":"56","author":"M. Fischetti","year":"1995","unstructured":"M. Fischetti (1995), \u201cClique tree inequalities define facets of the asymmetric travelling salesman polytope,\u201d Discrete Applied Mathematics 56, 9\u201318.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R. Giles","year":"1981","unstructured":"R. Giles and L.E. Trotter, Jr. (1981), \u201cOn stable set polyhedra for K 1,3-free graphs,\u201d Journal of Combinatorial Theory Ser. B 31, 313\u2013326.","journal-title":"Journal of Combinatorial Theory Ser. B"},{"key":"17_CR19","first-page":"251","volume-title":"The Travelling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M.W. Padberg (1985), \u201cPolyhedral theory,\u201d pp. 251\u2013305 in: E.L. Lawler et al., eds., The Travelling Salesman Problem, Wiley, New York."},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank (1986), \u201cClique tree inequalities and the symmetric travelling salesman problem,\u201d Mathematics of Operations Research 11, 537\u2013569.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR21","unstructured":"M. Hartmann (1988), \u201cCutting planes and the complexity of the integer hull,\u201d Ph.D. thesis, Cornell University."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"E.L. Johnson (1965), \u201cProgramming in networks and graphs\u201d, Research Report ORC 65-1, Operations Research Center, University of California-Berkeley.","DOI":"10.21236\/AD0614578"},{"key":"17_CR23","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1287\/moor.20.4.838","volume":"20","author":"M. Queyranne","year":"1995","unstructured":"M. Queyranne and Y. Wang (1995), \u201cSymmetric inequalities and their composition for asymmetric travelling salesman polytopes,\u201d Mathematics of Operations Research 20, 838\u2013863.","journal-title":"Mathematics of Operations Research"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"A. Schrijver (1980), \u201cOn cutting planes,\u201d in: M. Deza and I.G. Rosenberg, eds., Combinatorics 79 Part II, Ann. Discrete Math. 9, 291\u2013296.","DOI":"10.1016\/S0167-5060(08)70085-2"},{"key":"17_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver (1986), Theory of Linear and Integer Programming, Wiley, Chichester."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:18:38Z","timestamp":1556144318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}