{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:41Z","timestamp":1725586841785},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_11","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"130-142","source":"Crossref","is-referenced-by-count":10,"title":["On the Chv\u00e1tal-Gomory Closure of a Compact Convex Set"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Dadush","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Society for Industrial and Applied Mathematics, Philadelphia, PA (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-006-0051-y","volume":"113","author":"P. Bonami","year":"2008","unstructured":"Bonami, P., Dash, G.C.S., Fischetti, M., Lodi, A.: Projected Chvatal-Gomory Cuts for Mixed Integer Linear Programs. Mathematical Programming\u00a0113, 241\u2013257 (2008)","journal-title":"Mathematical Programming"},{"key":"11_CR3","volume-title":"An introduction to Diophantine approximation","author":"J.W.S. Cassels","year":"1972","unstructured":"Cassels, J.W.S.: An introduction to Diophantine approximation. Hafner, New York (1972)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M.T. \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0-1 conic programming. Mathematical Programming\u00a0104, 179\u2013202 (2005)","journal-title":"Mathematical Programming"},{"key":"11_CR5","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 Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory Closure of Strictly Convex Body (2010) (to appear in Mathematics of Operations Research)","DOI":"10.1007\/978-3-642-20807-2_11"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-13036-6_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"S.S. Dey","year":"2010","unstructured":"Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory Closure of an Ellipsoid Is a Polyhedron. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 327\u2013340. Springer, Heidelberg (2010)"},{"key":"11_CR8","unstructured":"Dunkel, J., Schulz, A.S.: The Gomory-chv\u00e1tal closure of a non-rational polytope is a rational polytope (2010), http:\/\/www.optimization-online.org\/DB_HTML\/2010\/11\/2803.html"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of mathematics"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e1tal closure. Mathematical Programming, Series B\u00a0110, 3\u201320 (2007)","journal-title":"Mathematical Programming, Series B"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.: On the symmetric travelling salesman problem I: Inequalities. Math. Programming\u00a016, 265\u2013280 (1979)","journal-title":"Math. Programming"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.: On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Programming\u00a016, 281\u2013302 (1979)","journal-title":"Math. Programming"},{"key":"11_CR14","volume-title":"Diophantine approximations","author":"I.M. Niven","year":"1963","unstructured":"Niven, I.M.: Diophantine approximations. Interscience Publishers, New York (1963)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A.: On cutting planes. Annals of Discrete Mathematics\u00a09, 291\u2013296 (1980); combinatorics 79 (Proc. Colloq., Univ. Montr\u00e9al, Montreal, Que., 1979), Part II","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:16:08Z","timestamp":1560298568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}