{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:56Z","timestamp":1740109256305,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T00:00:00Z","timestamp":1552953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10107-019-01379-y","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T14:29:13Z","timestamp":1555511353000},"page":"119-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lattice closures of polyhedra"],"prefix":"10.1007","volume":"181","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5837-0288","authenticated-orcid":false,"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"}]},{"given":"Diego A.","family":"Mor\u00e1n R.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"key":"1379_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 102, 457\u2013493 (2005)","journal-title":"Math. Program."},{"key":"1379_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed-integer linear sets based on lattice point free convex sets. Math. Oper. Res. 35, 233\u2013256 (2010)","journal-title":"Math. Oper. Res."},{"key":"1379_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Inequalities from two rows of a simplex tableau. In: IPCO 2007 Proceedings, Lecture Notes in Computer Science, vol. 4513, pp. 1\u201315 (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"1379_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.disopt.2012.06.003","volume":"9","author":"G Averkov","year":"2012","unstructured":"Averkov, G.: On finitely generated closures in the theory of cutting planes. Discrete Optim. 9, 209\u2013215 (2012)","journal-title":"Discrete Optim."},{"key":"1379_CR5","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/17M1128939","volume":"28","author":"G Averkov","year":"2018","unstructured":"Averkov, G., Basu, A., Paat, J.: Approximation of corner polyhedra with families of intersection cuts. SIAM J. Optim. 28, 904\u2013929 (2018)","journal-title":"SIAM J. Optim."},{"key":"1379_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1147-2","author":"J Bader","year":"2017","unstructured":"Bader, J., Hildebrand, R., Weismantel, R., Zemmer, K.: Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. (2017). https:\/\/doi.org\/10.1007\/s10107-017-1147-2","journal-title":"Math. Program."},{"key":"1379_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"1379_CR8","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"1379_CR9","unstructured":"Barvinok, A.: http:\/\/www.math.lsa.umich.edu\/~barvinok\/latticenotes669.pdf . Accessed 12 June 2015"},{"key":"1379_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-013-0639-y","volume":"145","author":"A Basu","year":"2014","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: The triangle closure is a polyhedron. Math. Program. 145, 19\u201358 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"1379_CR11","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704\u2013720 (2010)","journal-title":"Math. Oper. Res."},{"key":"1379_CR12","first-page":"221","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{0, 1\/2\\}$$-Chv\u00e1tal\u2013Gomory cuts. Math. Program. 74, 221\u2013235 (1996)","journal-title":"Math. Program."},{"key":"1379_CR13","doi-asserted-by":"crossref","unstructured":"Cevallos, A., Weltge, S., Zenklusen, R.: Lifting linear extension complexity bounds to the mixed-integer setting. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), pp. 788\u2013807 (2018)","DOI":"10.1137\/1.9781611975031.51"},{"issue":"115","key":"1379_CR14","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.J., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114(115), 455\u2013499 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1379_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, New York (2014)"},{"key":"1379_CR16","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":"1379_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s101070100250","volume":"91","author":"G Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols, G., Li, Y.: On the rank of mixed $$\\{0, 1\\}$$ polyhedra. Math. Program. 91, 391\u2013397 (2002)","journal-title":"Math. Program."},{"key":"1379_CR18","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\u2013Gomory closure of a compact convex set. Math. Program. 145, 327\u2013348 (2014)","journal-title":"Math. Program."},{"key":"1379_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-011-0455-1","volume":"135","author":"S Dash","year":"2012","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135, 221\u2013254 (2012)","journal-title":"Math. Program."},{"key":"1379_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.orl.2011.06.010","volume":"39","author":"S Dash","year":"2010","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: On mixed-integer sets with two integer variables. Oper. Res. Lett. 39, 305\u2013309 (2010)","journal-title":"Oper. Res. Lett."},{"key":"1379_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-012-0542-y","volume":"141","author":"S Dash","year":"2013","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On t-branch split cuts for mixed-integer programs. Math. Program. 141, 191\u2013199 (2013)","journal-title":"Math. Program."},{"key":"1379_CR22","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.disopt.2014.12.003","volume":"16","author":"S Dash","year":"2015","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Molinaro, M.: On the relative strength of different generalizations of split cuts. Discrete Optim. 16, 36\u201350 (2015)","journal-title":"Discrete Optim."},{"key":"1379_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-016-0982-x","volume":"160","author":"S Dash","year":"2016","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Mor\u00e1n R, D.A.: On the polyhedrality of cross and quadrilateral closures. Math. Program. 160, 245\u2013270 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1379_CR24","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., Mor\u00e1n R, D.A.: On the polyhedrality of closures of multi-branch split sets and other polyhedra with bounded max-facet-width. SIAM J. Optim. 27(3), 1340\u20131361 (2017)","journal-title":"SIAM J. Optim."},{"key":"1379_CR25","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\u2013Chv\u00e1tal closure of a non-rational polytope is a rational polytope. Math. Oper. Res. 38, 63\u201391 (2013)","journal-title":"Math. Oper. Res."},{"key":"1379_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"1379_CR27","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"F Higman","year":"1952","unstructured":"Higman, F.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3, 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1379_CR28","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.orl.2015.03.002","volume":"43","author":"R Hildebrand","year":"2015","unstructured":"Hildebrand, R., Oertel, T., Weismantel, R.: Note on the complexity of the mixed-integer hull of a polyhedron. Oper. Res. Lett. 43, 279\u2013282 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1379_CR29","doi-asserted-by":"crossref","unstructured":"Hildebrand, R., Weismantel, R., Zenklusen, R.: Extension complexity lower bounds for mixed-integer extended formulations. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) (2017)","DOI":"10.1137\/1.9781611974782.154"},{"key":"1379_CR30","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.disopt.2008.05.002","volume":"5","author":"Y Li","year":"2008","unstructured":"Li, Y., Richard, J.P.P.: Cook, Kannan and Schrijver\u2019s example revisited. Discrete Optim. 5, 724\u2013734 (2008)","journal-title":"Discrete Optim."},{"key":"1379_CR31","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"1379_CR32","first-page":"177","volume-title":"Mathematical Programming: Recent Developements and Applications","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developements and Applications, pp. 177\u2013210. Kluwer, Dordrecht (1989)"},{"key":"1379_CR33","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 problem. Math. Program. 7, 223\u2013235 (1974)","journal-title":"Math. Program."},{"key":"1379_CR34","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. Discrete Math. 9, 291\u2013296 (1980)","journal-title":"Ann. Discrete Math."},{"key":"1379_CR35","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)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01379-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01379-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01379-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T20:53:20Z","timestamp":1694811200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01379-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,19]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1379"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01379-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2019,3,19]]},"assertion":[{"value":"11 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}