{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:18:07Z","timestamp":1768778287242,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2018-04335"],"award-info":[{"award-number":["RGPIN-2018-04335"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2020-04346"],"award-info":[{"award-number":["RGPIN-2020-04346"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["DGECR-2020-00265"],"award-info":[{"award-number":["DGECR-2020-00265"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10107-021-01723-1","type":"journal-article","created":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T13:02:46Z","timestamp":1635771766000},"page":"1135-1147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The aggregation closure is polyhedral for packing and covering integer programs"],"prefix":"10.1007","volume":"195","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5290-1474","authenticated-orcid":false,"given":"Kanstantsin","family":"Pashkovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Poirrier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haripriya","family":"Pulyassary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,1]]},"reference":[{"key":"1723_CR1","first-page":"1","volume-title":"Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science","author":"K Andersen","year":"2007","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4513, pp. 1\u201315. Springer, Berlin (2007)"},{"issue":"4","key":"1723_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."},{"issue":"1\u20133","key":"1723_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1723_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(3), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1723_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0\u20131 programming. Math. Program. 94(2\u20133), 221\u2013245 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1723_CR6","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. Program. 171(1), 331\u2013359 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1723_CR7","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":"1723_CR8","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, Berlin (2014)"},{"issue":"1\u20133","key":"1723_CR9","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(1\u20133), 155\u2013174 (1990)","journal-title":"Math. Program."},{"issue":"5","key":"1723_CR10","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.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803\u2013834 (1983)","journal-title":"Oper. Res."},{"issue":"2","key":"1723_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0179-4","volume":"115","author":"S Dash","year":"2008","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On the strength of gomory mixed-integer cuts as group cuts. Math. Program. 115(2), 387\u2013407 (2008)","journal-title":"Math. Program."},{"key":"1723_CR12","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Mor\u00e1n\u00a0R., D.A.: Lattice closures of polyhedra. Math. Programm. 181(1), 119\u2013147 (2020)","DOI":"10.1007\/s10107-019-01379-y"},{"key":"1723_CR13","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."},{"issue":"2","key":"1723_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.orl.2021.01.013","volume":"49","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Gijswijt, D., Linderoth, J., Zhu, H.: Integer packing sets form a well-quasi-ordering. Oper. Res. Lett. 49(2), 226\u2013230 (2021)","journal-title":"Oper. Res. Lett."},{"key":"1723_CR15","unstructured":"Del\u00a0Pia, A., Linderoth, J., Zhu, H.: The aggregation closure for packing and covering polyhedra are polyhedra. Poster Presented at the MIP 2019 Workshop, Boston (2019)"},{"issue":"4","key":"1723_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"1723_CR17","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A.: On the knapsack closure of 0-1 integer linear programs. Electron. Notes Discrete Math. 36, 799\u2013804 (2010). ISCO 2010\u2014International Symposium on Combinatorial Optimization","DOI":"10.1016\/j.endm.2010.05.101"},{"issue":"1\u20132","key":"1723_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-009-0284-7","volume":"128","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., Goycoolea, M.: On the exact separation of mixed integer knapsack cuts. Math. Program. 128(1\u20132), 19\u201341 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"1723_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s12532-018-0132-y","volume":"10","author":"R Fukasawa","year":"2018","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: Intersection cuts for single row corner relaxations. Math. Program. Comput. 10(3), 423\u2013455 (2018)","journal-title":"Math. Program. Comput."},{"issue":"5","key":"1723_CR20","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(5), 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"1723_CR21","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960)"},{"key":"1723_CR22","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: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"1723_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, part I. Math. Program. 3, 23\u201385 (1972)","journal-title":"Math. Program."},{"key":"1723_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, part II. Math. Program. 3, 359\u2013389 (1972)","journal-title":"Math. Program."},{"key":"1723_CR25","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z Gu","year":"1998","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted cover inequalities for 0\u20131 integer programs: computation. INFORMS J. Comput. 10, 427\u2013437 (1998)","journal-title":"INFORMS J. Comput."},{"key":"1723_CR26","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"EL Johnson","year":"1974","unstructured":"Johnson, E.L.: On the group problem for mixed integer programming. Math. Program. Study 2, 137\u2013179 (1974)","journal-title":"Math. Program. Study"},{"issue":"3","key":"1723_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve mips. Oper. Res. 49(3), 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"1723_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"1723_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"1723_CR30","doi-asserted-by":"crossref","unstructured":"Schrijver, A.: On cutting planes. In: Hammer, P.L. (ed) Combinatorics 79, volume\u00a09 of Annals of Discrete Mathematics, pp. 291\u2013296. Elsevier (1980)","DOI":"10.1016\/S0167-5060(08)70085-2"},{"issue":"1","key":"1723_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Program. 8(1), 165\u2013178 (1975)","journal-title":"Math. Program."},{"issue":"1","key":"1723_CR32","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E Zemel","year":"1978","unstructured":"Zemel, E.: Lifting the facets of zero-one polytopes. Math. Program. 15(1), 268\u2013277 (1978)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01723-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01723-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01723-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T02:10:19Z","timestamp":1699755019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01723-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["1723"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01723-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,1]]},"assertion":[{"value":"7 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}