{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:16:40Z","timestamp":1761621400281,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI 1560828"],"award-info":[{"award-number":["CMMI 1560828"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["00014-18-12129","00014-18-12129"],"award-info":[{"award-number":["00014-18-12129","00014-18-12129"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10107-018-1317-x","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T14:13:19Z","timestamp":1534860799000},"page":"21-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Rational Polytopes with Chv\u00e1tal Rank 1"],"prefix":"10.1007","volume":"179","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3802-1371","authenticated-orcid":false,"given":"Dabeen","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"1317_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF02711514","volume":"16","author":"W Banaszczyk","year":"1996","unstructured":"Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices in $$\\mathbb{R}^n$$ II: application of $$K$$-convexity. Discret. Comput. Geom. 16, 305\u2013311 (1996)","journal-title":"Discret. Comput. Geom."},{"key":"1317_CR2","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1287\/moor.24.3.728","volume":"24","author":"W Banaszczyk","year":"1999","unstructured":"Banaszczyk, W., Litvak, A., Pajor, A., Szarek, S.: The flatness theorem for nonsymmetric convex bodies via the local theory of Banach spaces. Math. Oper. Res. 24, 728\u2013750 (1999)","journal-title":"Math. Oper. Res."},{"key":"1317_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on positive integral solutions to linear Diophantine equations. Proc. Am. Math. Soc. 55, 299\u2013304 (1976)","journal-title":"Proc. Am. Math. Soc."},{"key":"1317_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-76796-1_2","volume-title":"Research Trends in Combinatorial Optimization","author":"S Boyd","year":"2009","unstructured":"Boyd, S., Pulleyblank, W.R.: Facet generating techniques. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 33\u201355. Springer, Berlin (2009)"},{"key":"1317_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1317_CR6","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. Discret. Math. 4, 305\u2013337 (1973)","journal-title":"Discret. Math."},{"issue":"115","key":"1317_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114","author":"V Chv\u00e1tal","year":"1989","unstructured":"Chv\u00e1tal, V., Cook, W., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114(115), 455\u2013499 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1317_CR8","first-page":"221","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{0,1\/2\\}$$-Chv\u00e1tal-Gomory cuts. Math. Progr. 74, 221\u2013235 (1996)","journal-title":"Math. Progr."},{"key":"1317_CR9","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-33461-5_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"G\u00e9rard Cornu\u00e9jols","year":"2016","unstructured":"Cornu\u00e9jols, G., Lee, D.: On some polytopes contained in the 0,1 hypercube that have a small Chv\u00e1tal rank, In: Louveaux Q., Skutella M. (eds.) Proceedings of IPCO XVIII, Li\u00e8ge, Belgium, June 2016. Lecture Notes in Computer Science vol. 9682, pp. 387\u2013398 (2016)"},{"key":"1317_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-33461-5_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"G\u00e9rard Cornu\u00e9jols","year":"2016","unstructured":"Cornu\u00e9jols, G., Li, Y.: Deciding emptiness of the Gomory-Chv\u00e1tal closure is NP-complete, even for a rational polyhedron containing no integer point. In: Louveaux Q., Skutella M. (eds.) Proceedings of IPCO XVIII, Li\u00e8ge, Belgium, June 2016. Lecture Notes in Computer Science vol. 9682, pp. 387\u2013398 (2016)"},{"key":"1317_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.orl.2018.01.013","volume":"46","author":"G Cornu\u00e9jols","year":"2018","unstructured":"Cornu\u00e9jols, G., Li, Y.: When the Gomory-Chv\u00e1tal closure coincides with the integer hull. Oper. Res. Lett. 46, 251\u2013256 (2018)","journal-title":"Oper. Res. Lett."},{"unstructured":"Dadush, D.: Integer programming, lattice algorithms, and deterministic volume estimation, Ph.D. Thesis, Georgia Institute of Technology (2012)","key":"1317_CR12"},{"key":"1317_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.1110.0488","volume":"36","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory closure of a strictly convex body. Math. Oper. Res. 36, 227\u2013239 (2011)","journal-title":"Math. Oper. Res."},{"key":"1317_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-013-0649-9","volume":"145","author":"D Dadush","year":"2014","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: On the Chv\u00e1tal-Gomory closure of a compact convex set. Math. Progr. 145, 327\u2013348 (2014)","journal-title":"Math. Progr."},{"doi-asserted-by":"crossref","unstructured":"Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via $$M$$-ellipsoid coverings. In: Proceedings of FOCS 2011, 580\u2013589 (2011)","key":"1317_CR15","DOI":"10.1109\/FOCS.2011.31"},{"key":"1317_CR16","doi-asserted-by":"publisher","first-page":"19237","DOI":"10.1073\/pnas.1203863110","volume":"110","author":"D Dadush","year":"2013","unstructured":"Dadush, D., Vempala, S.: Near-optimal deterministic algorithms for volume computation via $$M$$-ellipsoids. Proc. Natl. Acad. Sci. 110, 19237\u201319245 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1317_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-13036-6_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"Santanu 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 FB. (eds.) Proceedings of IPCO XIV, Lausanne, Switzerland, June 2010. Lecture Notes in Computer Science, vol. 6080, pp. 327\u2013340 (2010)"},{"key":"1317_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Path, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"1317_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"unstructured":"Eisenbrand, F., Funke, S., Garg, N., K\u00f6nemann, J.: A combinatorial algorithm for computing a maximum independent set in a $$t$$-perfect graph. In: Proceedings of SODA 2003, 517\u2013522 (2003)","key":"1317_CR20"},{"key":"1317_CR21","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"1317_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"AMH Gerards","year":"1986","unstructured":"Gerards, A.M.H., Schrijver, A.: Matrices with the Edmonds\u2013Johnson property. Combinatorica 6, 365\u2013379 (1986)","journal-title":"Combinatorica"},{"key":"1317_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"1317_CR24","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1090\/S0002-9939-1951-0052801-9","volume":"2","author":"PC Hammer","year":"1951","unstructured":"Hammer, P.C.: The centroid of a convex body. Proc. Am. Math. Soc. 2, 522\u2013525 (1951)","journal-title":"Proc. Am. Math. Soc."},{"key":"1317_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.disopt.2012.11.003","volume":"10","author":"R Hildebrand","year":"2013","unstructured":"Hildebrand, R., K\u00f6ppe, M.: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity $$2^{O(n\\log n)}$$. Discret. Optim. 10, 69\u201384 (2013)","journal-title":"Discret. Optim."},{"key":"1317_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Heidelberg (2001)"},{"key":"1317_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"1317_CR28","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R Kannan","year":"1988","unstructured":"Kannan, R., Lov\u00e1sz, L.: Covering minima and lattice point free convex bodies. Ann. Math. 128, 577\u2013602 (1988)","journal-title":"Ann. Math."},{"key":"1317_CR29","first-page":"113","volume":"12","author":"A Khinchine","year":"1948","unstructured":"Khinchine, A.: A quantitative formulation of Kroneckers theory of approximation. Izv. Akad. Nauk SSSR Ser. Mat. 12, 113\u2013122 (1948)","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"unstructured":"Lee, D.: Structure and complexity in integer programming, Ph.D. dissertation, Carnegie Mellon University (in preparation)","key":"1317_CR30"},{"key":"1317_CR31","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1317_CR32","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.orl.2011.07.003","volume":"39","author":"AN Letchford","year":"2011","unstructured":"Letchford, A.N., Pokutta, S., Schulz, A.S.: On the membership problem for the $$\\{0,1\/2\\}$$-closure. Oper. Res. Lett. 39, 301\u2013304 (2011)","journal-title":"Oper. Res. Lett."},{"key":"1317_CR33","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1137\/080737587","volume":"20","author":"A Mahajan","year":"2010","unstructured":"Mahajan, A., Ralphs, T.: On the complexity of selecting disjunctions in integer programming. SIAM J. Optim. 20, 2181\u20132198 (2010)","journal-title":"SIAM J. Optim."},{"key":"1317_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1009842406728","volume":"4","author":"M Rudelson","year":"2000","unstructured":"Rudelson, M.: Distance between non-symmetric convex bodies and the $$MM^*$$-estimate. Positivity 4, 161\u2013178 (2000)","journal-title":"Positivity"},{"key":"1317_CR35","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. Ann. Discret. Math. 9, 291\u2013296 (1980)","journal-title":"Ann. Discret. Math."},{"key":"1317_CR36","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"unstructured":"Seb\u00f6, A.: An introduction to empty lattice simplices. In: Cornu\u00e9jols G., Burkard R.E., Woeginger G.J. (eds.)Proceedings of IPCO XII, Graz, Austria, June 1999. Lecture Notes in Computer Science, vol. 1610, pp. 400\u2013414 (1999)","key":"1317_CR37"},{"key":"1317_CR38","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02039523","volume":"1","author":"W S\u00fcss","year":"1948","unstructured":"S\u00fcss, W.: \u00dcber eine affininvariant von Eibereichen. Archiv der Math. 1, 127\u2013128 (1948)","journal-title":"Archiv der Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1317-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1317-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1317-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:29:44Z","timestamp":1589646584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1317-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1317"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1317-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"14 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}