{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:51Z","timestamp":1740109311700,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141812096"],"award-info":[{"award-number":["N000141812096"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF2006587"],"award-info":[{"award-number":["CCF2006587"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA95502010341"],"award-info":[{"award-number":["FA95502010341"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-022-01802-x","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:03:00Z","timestamp":1648504980000},"page":"411-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-halfspace closure"],"prefix":"10.1007","volume":"197","author":[{"given":"Amitabh","family":"Basu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9840-078X","authenticated-orcid":false,"given":"Hongyi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"issue":"3","key":"1802_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(3), 457\u2013493 (2005)","journal-title":"Math. Program."},{"issue":"4","key":"1802_CR2","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(4), 209\u2013215 (2012)","journal-title":"Discrete Optim."},{"key":"1802_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00148-3","volume-title":"Disjunctive Programming","author":"E Balas","year":"2018","unstructured":"Balas, E.: Disjunctive Programming. Springer, New York (2018)"},{"key":"1802_CR4","unstructured":"Basu, A., Conforti, M., Di\u00a0Summa, M., Jiang, H.: Split cuts in the plane. To appear in SIAM J. on optimization. arxiv.org:2003.05022 (2020)"},{"issue":"1\u20132","key":"1802_CR5","first-page":"1","volume":"145","author":"A Basu","year":"2013","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: The triangle closure is a polyhedron. Math. Program. Ser. A 145(1\u20132), 1\u201340 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"1802_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10107-015-0890-5","volume":"151","author":"A Basu","year":"2015","unstructured":"Basu, A., Conforti, M., Di Summa, M.: A geometric approach to cut-generating functions. Math. Program. 151(1), 153\u2013189 (2015)","journal-title":"Math. Program."},{"key":"1802_CR7","unstructured":"Bell, D.E.: Intersections of corner polyhedra. Int. Inst. Appl. Syst. Anal. Laxenburg, Austria, Res. Memo RM-74-014. (1974)"},{"issue":"2","key":"1802_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"DE Bell","year":"1977","unstructured":"Bell, D.E.: A theorem concerning the integer lattice. Stud. Appl. Math. 56(2), 187\u2013188 (1977)","journal-title":"Stud. Appl. Math."},{"issue":"1","key":"1802_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01580451","volume":"8","author":"David E Bell","year":"1975","unstructured":"Bell, David E., Fisher, Marshall L.: Improved integer programming bounds using intersections of corner polyhedra. Math. Program. 8(1), 345\u2013368 (1975)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1802_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-017-1192-x","volume":"171","author":"M Bodur","year":"2018","unstructured":"Bodur, M., Del Pia, A., Dey, S.S., Molinaro, M., Pokutta, S.: Aggregation-based cutting-planes for packing and covering integer programs. Math. Programm. 171(1\u20132), 331\u2013359 (2018)","journal-title":"Math. Programm."},{"issue":"4","key":"1802_CR11","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 Math. 4(4), 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"1802_CR12","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, vol. 271. Springer, New York (2014)"},{"key":"1802_CR13","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."},{"issue":"1","key":"1802_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01191202","volume":"12","author":"WJ Cook","year":"1992","unstructured":"Cook, W.J., Hartmann, M.E., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27\u201337 (1992)","journal-title":"Combinatorica"},{"key":"1802_CR15","unstructured":"Dash, S., Gunluk, O., Lee, D.: Generalized chvatal-gomory closures for integer programs with bounds on variables. http:\/\/www.optimization-online.org\/DB_HTML\/2019\/06\/7245.html. (2019)"},{"key":"1802_CR16","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Mor\u00e1n\u00a0R, Diego\u00a0A.: Lattice closures of polyhedra. Math. Program. 1\u201329 (2019)","DOI":"10.1007\/s10107-019-01379-y"},{"issue":"1\u20132","key":"1802_CR17","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., Diego, A.: On the polyhedrality of cross and quadrilateral closures. Math. Program. 160(1\u20132), 245\u2013270 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1802_CR18","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., Diego, A.: On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width. SIAM J. Opt. 27(3), 1340\u20131361 (2017)","journal-title":"SIAM J. Opt."},{"key":"1802_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_10","volume-title":"On a Generalization of the Chv\u00e1tal-Gomory Closure","author":"S Dash","year":"2020","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lee, D.: On a Generalization of the Chv\u00e1tal-Gomory Closure. Springer, IPCO, New York (2020)"},{"issue":"6","key":"1802_CR20","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2018.11.001","volume":"46","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Iroume, A., Wang, G.: The strength of multi-row aggregation cuts for sign-pattern integer programs. Oper. Res. Lett. 46(6), 611\u2013615 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1802_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01949705","volume":"3","author":"J-P Doignon","year":"1973","unstructured":"Doignon, J.-P.: Convexity in cristallographical lattices. J. Geometry 3, 71\u201385 (1973)","journal-title":"J. Geometry"},{"key":"1802_CR22","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":"1802_CR23","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"4","key":"1802_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"1802_CR25","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1137\/S009753979528977X","volume":"28","author":"W Harvey","year":"1999","unstructured":"Harvey, W.: Computing two-dimensional integer hulls. SIAM J. Comput. 28(6), 2285\u20132299 (1999)","journal-title":"SIAM J. Comput."},{"key":"1802_CR26","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1111\/j.1749-6632.1979.tb32803.x","volume":"319","author":"AJ Hoffman","year":"1979","unstructured":"Hoffman, A.J.: Binding constraints and Helly numbers. Ann. N. Y. Acad. Sci. 319, 284\u2013288 (1979)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"1802_CR27","unstructured":"Keller, W.: Tightening the Chv\u00e1tal and split operator via low-codimensional lineality spaces. PhD thesis, Department of Mathematics, Otto-von-Guericke-Universit\u00e4t Magdeburg (2019)"},{"key":"1802_CR28","unstructured":"Pashkovich, K., Poirrier, L., Pulyassary, H.: The aggregation closure is polyhedral for packing and covering integer programs. arXiv preprint arXiv:1910.03404. (2019)"},{"key":"1802_CR29","unstructured":"Ralph, E.: Gomory. An algorithm for the mixed integer problem. Technical Report, DTIC Document (1960)"},{"issue":"9","key":"1802_CR30","doi-asserted-by":"publisher","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"HE Scarf","year":"1977","unstructured":"Scarf, H.E.: An observation on the structure of production sets with indivisibilities. Proc. Natl. Acad. Sci. 74(9), 3637\u20133641 (1977)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1802_CR31","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01802-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01802-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01802-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:06:54Z","timestamp":1674349614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01802-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1802"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01802-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"10 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}