{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:25Z","timestamp":1760061565180},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T00:00:00Z","timestamp":1273795200000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0370-x","type":"journal-article","created":{"date-parts":[[2010,5,13]],"date-time":"2010-05-13T07:57:16Z","timestamp":1273737436000},"page":"45-68","source":"Crossref","is-referenced-by-count":2,"title":["Small Chv\u00e1tal Rank"],"prefix":"10.1007","volume":"124","author":[{"given":"Tristram","family":"Bogart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annie","family":"Raymond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rekha","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,14]]},"reference":[{"issue":"1","key":"370_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/jcta.1997.2780","volume":"79","author":"N. Alon","year":"1997","unstructured":"Alon N., Vu V.: Anti-Hadamard matrices, coin weighing, threshold gates and indecomposable hypergraphs. J. Comb. Theory Ser. A 79(1), 133\u2013160 (1997)","journal-title":"J. Comb. Theory Ser. A"},{"key":"370_CR2","volume-title":"Algorithmic Number Theory, Vol. 1: Efficient Algorithms, Foundations of Computing Series","author":"E. Bach","year":"1996","unstructured":"Bach E., Shallit J.: Algorithmic Number Theory, Vol. 1: Efficient Algorithms, Foundations of Computing Series. MIT Press, Cambridge, MA (1996)"},{"key":"370_CR3","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A. Barvinok","year":"2003","unstructured":"Barvinok A., Woods K.: Short rational generating functions for lattice point problems. J. Am. Math. Soc. 16, 957\u2013979 (2003)","journal-title":"J. Am. Math. Soc."},{"key":"370_CR4","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 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"370_CR5","unstructured":"Bruns, W., Ichim, B.: NORMALIZ. Computing normalizations of affine semigroups. With contributions by C. S\u00f6ger. Available at http:\/\/www.math.uos.de\/normaliz"},{"key":"370_CR6","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."},{"issue":"2","key":"370_CR7","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(2), 245\u2013261 (2003)","journal-title":"Combinatorica"},{"issue":"1","key":"370_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.1715","volume":"69","author":"A. Galluccio","year":"1997","unstructured":"Galluccio A., Sassano A.: The rank facets of the stable set polytope for claw-free graphs. J. Comb. Theory Ser. B 69(1), 1\u201338 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"370_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R. Giles","year":"1981","unstructured":"Giles R., Trotter L.E. Jr.: On stable set polyhedra for K 1,3-free graphs. J. Comb. Theory Ser. B 31(3), 313\u2013326 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"370_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization. Volume 2 of Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Volume 2 of Algorithms and Combinatorics. 2nd edn. Springer, Berlin (1993)","edition":"2"},{"issue":"3","key":"370_CR11","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/B:JACO.0000030705.93448.ce","volume":"19","author":"S. Ho\u015ften","year":"2004","unstructured":"Ho\u015ften S., Maclagan D., Sturmfels B.: Supernormal vector configurations. J. Algebraic Comb. 19(3), 297\u2013313 (2004)","journal-title":"J. Algebraic Comb."},{"issue":"1","key":"370_CR12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s001860300317","volume":"59","author":"T.M. Liebling","year":"2004","unstructured":"Liebling T.M., Oriolo G., Spille B., Stauffer G.: On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Math. Methods Oper. Res. 59(1), 25\u201335 (2004)","journal-title":"Math. Methods Oper. Res."},{"issue":"1, Ser. A","key":"370_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/PL00011376","volume":"88","author":"L. Lipt\u00e1k","year":"2000","unstructured":"Lipt\u00e1k L., Lov\u00e1sz L.: Facets with fixed defect of the stable set polytope. Math. Program. 88(1, Ser. A), 33\u201344 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"370_CR14","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(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"370_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0097-3165(03)00117-1","volume":"104","author":"D. Maclagan","year":"2003","unstructured":"Maclagan D., Thomas R.R.: The toric Hilbert scheme of a rank two lattice is smooth and irreducible. J. Comb. Theory Ser. A 104, 29\u201348 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"key":"370_CR16","volume-title":"Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (1986)"},{"key":"370_CR17","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Vol. A, volume 24 of Algorithms and Combinatorics. Springer, Berlin (2003) (Paths, flows, matchings, Chapters 1\u201338)"},{"key":"370_CR18","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Vol. A, volume 24 of Algorithms and Combinatorics. Springer, Berlin (2003) (Matroids, trees, stable sets, Chapters 39\u201369)"},{"issue":"3","key":"370_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"370_CR20","doi-asserted-by":"crossref","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. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"370_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.24.1.1","volume":"24","author":"T. Stephen","year":"1999","unstructured":"Stephen T., Tun\u00e7el L.: On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. 24(1), 1\u20137 (1999)","journal-title":"Math. Oper. Res."},{"key":"370_CR22","first-page":"1","volume-title":"Lectures on 0\/1-polytopes. Polytopes\u2014combinatorics and computation, Oberwolfach, 1997, volume 29 of DMV Sem","author":"G.M. Ziegler","year":"2000","unstructured":"Ziegler G.M.: Lectures on 0\/1-polytopes. Polytopes\u2014combinatorics and computation, Oberwolfach, 1997, volume 29 of DMV Sem, pp. 1\u201341. Birkh\u00e4user, Basel (2000)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0370-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0370-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0370-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:08Z","timestamp":1559109008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0370-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,14]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0370-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,14]]}}}