{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:09Z","timestamp":1740109269002,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010446","name":"Institute for Basic Science","doi-asserted-by":"crossref","award":["No. IBS-R209-C1"],"award-info":[{"award-number":["No. IBS-R209-C1"]}],"id":[{"id":"10.13039\/501100010446","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10107-020-01539-5","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T13:03:31Z","timestamp":1594386211000},"page":"393-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Chv\u00e1tal-Gomory closures for integer programs with bounds on variables"],"prefix":"10.1007","volume":"190","author":[{"given":"Sanjeeb","family":"Dash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3802-1371","authenticated-orcid":false,"given":"Dabeen","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,10]]},"reference":[{"key":"1539_CR1","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/moor.26.2.304.10555","volume":"26","author":"A Bockmayr","year":"2001","unstructured":"Bockmayr, A., Eisenbrand, F.: Cutting planes and the elementary closure in fixed dimension. Math. Oper. Res. 26, 304\u2013312 (2001)","journal-title":"Math. Oper. Res."},{"key":"1539_CR2","doi-asserted-by":"crossref","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: Cutting planes from wide split disjunction, IPCO 2017. In: Eisenbrand, F., K\u00f6nemann, J. (eds.) LNCS 10328, pp. 99\u2013110 (2017)","DOI":"10.1007\/978-3-319-59250-3_9"},{"key":"1539_CR3","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"1539_CR4","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."},{"key":"1539_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"1539_CR6","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. Program. 145, 327\u2013348 (2014)","journal-title":"Math. Program."},{"key":"1539_CR7","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/16M1087783","volume":"27","author":"S Dash","year":"2017","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Moran, D.A.R.: On the polyhedrality of closures of multi-branch split sets and other polyhedra with bounded max-facet-width. SIAM J. Optim. 27, 1340\u20131361 (2017)","journal-title":"SIAM J. Optim."},{"key":"1539_CR8","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Moran, D.A.R.: Lattice closures of polyhedra. In: Mathematical Programming"},{"key":"1539_CR9","unstructured":"Del Pia, A., Gijswijt, D., Linderoth, J., Zhu, H.: Integer packing sets form a well-quasi-ordering. arXiv:1911.12841 (2019)"},{"key":"1539_CR10","unstructured":"Dirichlet, G.L.: Verallgemeinerung eines Satzes aus der Lehre von den Kettenbriichen nebst einigen Anwendungen auf die Theorie der Zahlen. Bericht iiber die zur Bekanntmachung geeigneten Verhandlungen der K\u00f6niglich Preussischen Akademie der Wissenschaften zu Berlin (1842) 93\u201395. (Reprinted in: L. Kronecker (ed.) G.L. Dirichlet\u2019s Werke Vol. I, G. Reimer, Berlin, 1889 (reprinted: Chelsea, New York, 1969), pp. 635\u2013638)"},{"key":"1539_CR11","unstructured":"Dunkel, J., Schulz, A.S.: A refined Gomory-Chv\u00e1tal closure for polytopes in the unit cube. Technical report. http:\/\/www.optimization-online.org\/DB_HTML\/2012\/03\/3404.html (2012). Accessed 7 June 2020"},{"key":"1539_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/moor.1120.0565","volume":"38","author":"J Dunkel","year":"2013","unstructured":"Dunkel, J., Schulz, A.S.: The Gomory-Chv\u00e1tal closure of a nonrational polytope is a rational polytope. Math. Oper. Res. 38, 63\u201391 (2013)","journal-title":"Math. Oper. Res."},{"key":"1539_CR13","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"},{"key":"1539_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.endm.2010.05.101","volume":"36","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Lodi, A.: On the knapsack closure of 0\u20131 integer linear programs. Electron. NotesDiscret. Math. 36, 799\u2013804 (2010)","journal-title":"Electron. NotesDiscret. Math."},{"key":"1539_CR15","doi-asserted-by":"crossref","unstructured":"Furini, F., Ljubi\u0107, I., Sinnl, M.: ILP and CP formulations for the lazy bureaucrat problem, CPAIOR 2015. In: Michel, L. (ed.) LNCS, vol. 9075, pp. 255\u2013270 (2015)","DOI":"10.1007\/978-3-319-18008-3_18"},{"key":"1539_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"1539_CR17","unstructured":"Huchette, J.: Advanced mixed-integer programming formulations: methodology, computation, and application, Ph.D. thesis, Massachusetts Institute of Technology (2018)"},{"key":"1539_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed integer programming problems. Math. Program. 7, 223\u2013235 (1974)","journal-title":"Math. Program."},{"key":"1539_CR19","unstructured":"Pashkovich, K., Poirrier, L., Pulyassary, H.: The aggregation closure is polyhedral for packing and covering integer programs arXiv:1910.03404 (2019)"},{"key":"1539_CR20","unstructured":"Pokutta, S.: Lower bounds for Chv\u00e1tal-Gomory style operators. Technical report. http:\/\/www.optimization-online.org\/DB_HTML\/2011\/09\/3151.html (2011). Accessed 7 June 2020"},{"key":"1539_CR21","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":"1539_CR22","doi-asserted-by":"publisher","first-page":"4471","DOI":"10.1287\/mnsc.2017.2856","volume":"64","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Embedding formulations and complexity for unions of polyhedra. Manag. Sci. 64, 4471\u20134965 (2018)","journal-title":"Manag. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01539-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01539-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01539-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T02:51:42Z","timestamp":1633834302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01539-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,10]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1539"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01539-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2020,7,10]]},"assertion":[{"value":"27 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}