{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T12:00:00Z","timestamp":1775908800684,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T00:00:00Z","timestamp":1505692800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T00:00:00Z","timestamp":1505692800000},"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#1149400"],"award-info":[{"award-number":["CMMI#1149400"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1452463"],"award-info":[{"award-number":["CMMI-1452463"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10107-017-1192-x","type":"journal-article","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T13:05:12Z","timestamp":1505739912000},"page":"331-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Aggregation-based cutting-planes for packing and covering integer programs"],"prefix":"10.1007","volume":"171","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9276-3755","authenticated-orcid":false,"given":"Merve","family":"Bodur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Del Pia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,18]]},"reference":[{"issue":"1","key":"1192_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10107-005-0598-z","volume":"105","author":"D Bienstock","year":"2006","unstructured":"Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9\u201327 (2006)","journal-title":"Math. Program."},{"key":"1192_CR2","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-integer programming: a progress report. In: Gr\u00f6tschel, M. (ed.) The Sharpest Cut: The Impact of Manfred Padberg and His Work, chap.\u00a018, pp. 309\u2013326. SIAM, Philadelphia (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"1192_CR3","unstructured":"Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA, pp. 106\u2013115 (2000)"},{"key":"1192_CR4","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114\/115","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":"1192_CR5","doi-asserted-by":"publisher","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, Berlin (2014)"},{"issue":"1","key":"1192_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/140959882","volume":"29","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Del Pia, A., Di Summa, M., Faenza, Y., Grappe, R.: Reverse Chv\u00e1tal\u2013Gomory rank. SIAM J. Discrete Math. 29(1), 166\u2013181 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1192_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/ijoc.11.2.205","volume":"11","author":"G Cornu\u00e9jols","year":"1999","unstructured":"Cornu\u00e9jols, G., Dawande, M.: A class of hard small 0\u20131 programs. INFORMS J. Comput. 11, 205\u2013210 (1999)","journal-title":"INFORMS J. Comput."},{"key":"1192_CR8","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Analysis of sparse cutting-planes for sparse MILPs with applications to stochastic MILPs. \n                    arXiv:1601.00198\n                    \n                   (2016)"},{"key":"1192_CR9","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Mor\u00e1n R., D.A.: Some properties of convex hulls of integer points contained in general convex sets. Math.\u00a0Program. 141(1-2), 507\u2013526 (2013)","DOI":"10.1007\/s10107-012-0538-7"},{"key":"1192_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e1tal closure. Math. Program. 110, 3\u201320 (2007)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1192_CR11","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). doi:\n                    10.1007\/s10107-009-0284-7","journal-title":"Math. Program."},{"issue":"6","key":"1192_CR12","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.2307\/1914264","volume":"44","author":"D Gale","year":"1976","unstructured":"Gale, D., Rockwell, R.: The Malinvaud eigenvalue lemma: correction and amplification. Econometrica (pre-1986) 44(6), 1323 (1976)","journal-title":"Econometrica (pre-1986)"},{"key":"1192_CR13","volume-title":"Linear Semi-infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Linear Semi-infinite Optimization. Wiley, London (1998)"},{"key":"1192_CR14","first-page":"335","volume":"69","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X.: Worst-case comparison of valid inequalities for the TSP. Math. Program. 69, 335\u2013349 (1995)","journal-title":"Math. Program."},{"key":"1192_CR15","unstructured":"Hartmann, M.: Cutting planes and the complexity of the integer hull. Tech. rep., Cornell University Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1998)"},{"key":"1192_CR16","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.): 50 Years of Integer Programming 1958\u20132008\u2014From the Early Years to the State-of-the-Art. Springer, Berlin (2010)","DOI":"10.1007\/978-3-540-68279-0"},{"key":"1192_CR17","doi-asserted-by":"crossref","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger et\u00a0al. [16], pp. 619\u2013645","DOI":"10.1007\/978-3-540-68279-0_16"},{"key":"1192_CR18","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.A.: Cutting planes in integer and mixed integer programming. Discrete Appl. Math. 123, 397\u2013446 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1192_CR19","unstructured":"Molinaro, M.: Understanding the strength of general-purpose cutting planes. Ph.D. thesis, Carnegie Mellon University (2013)"},{"key":"1192_CR20","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-Interscience, New York (1988)"},{"key":"1192_CR21","doi-asserted-by":"crossref","unstructured":"Pokutta, S., Schulz, A.S.: On the rank of cutting-plane proof systems. In: Eisenbrand, F, Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization, pp. 450\u2013463. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13036-6_34"},{"issue":"3","key":"1192_CR22","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.orl.2011.03.001","volume":"39","author":"S Pokutta","year":"2011","unstructured":"Pokutta, S., Stauffer, G.: Lower bounds for the Chv\u00e1tal\u2013Gomory rank in the 0\/1 cube. Oper. Res. Lett. 39(3), 200\u2013203 (2011). doi:\n                    10.1016\/j.orl.2011.03.001","journal-title":"Oper. Res. Lett."},{"key":"1192_CR23","doi-asserted-by":"crossref","unstructured":"Richard, J.P.P., Dey, S.S.: The group-theoretic approach in mixed integer programming. In: J\u00fcnger et\u00a0al. [16], chap.\u00a019, pp. 727\u2013801","DOI":"10.1007\/978-3-540-68279-0_19"},{"key":"1192_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafeller","year":"1970","unstructured":"Rockafeller, R.T.: Convex Analysis. Princeton University Press, New Jersey (1970)"},{"key":"1192_CR25","doi-asserted-by":"publisher","unstructured":"Rothvo\u00df, T., Sanit\u00e0, L.: 0\/1 polytopes with quadratic Chv\u00e1tal rank. In: Integer Programming and Combinatorial Optimization\u201416th International Conference, IPCO 2013, Valpara\u00edso, Chile, March 18\u201320, 2013. Proceedings, pp. 349\u2013361 (2013). doi:\n                    10.1007\/978-3-642-36694-9_30","DOI":"10.1007\/978-3-642-36694-9_30"},{"key":"1192_CR26","first-page":"291","volume":"79","author":"A Schrijver","year":"1980","unstructured":"Schrijver, A.: On cutting planes. Combinatorics 79, 291\u2013296 (1980)","journal-title":"Combinatorics"},{"key":"1192_CR27","doi-asserted-by":"publisher","unstructured":"Singh, M., Talwar, K.: Improving integrality gaps via Chv\u00e1tal\u2013Gomory rounding. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1\u20133, 2010. Proceedings, pp. 366\u2013379 (2010). doi:\n                    10.1007\/978-3-642-15369-3_28","DOI":"10.1007\/978-3-642-15369-3_28"},{"issue":"2","key":"1192_CR28","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput. 29(2), 648\u2013670 (1999)","journal-title":"SIAM J. Comput."},{"key":"1192_CR29","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2013)"},{"issue":"3","key":"1192_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02614517","volume":"77","author":"R Weismantel","year":"1997","unstructured":"Weismantel, R.: On the 0\/1 knapsack polytope. Math. Program. 77(3), 49\u201368 (1997)","journal-title":"Math. Program."},{"key":"1192_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, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"1192_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\u2013one polytopes. Math. Program. 15, 268\u2013277 (1978)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1192-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1192-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1192-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:22:35Z","timestamp":1589646155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1192-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,18]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1192"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1192-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,18]]},"assertion":[{"value":"29 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}