{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:44Z","timestamp":1781345624092,"version":"3.54.1"},"reference-count":211,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"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":["1562578"],"award-info":[{"award-number":["1562578"]}],"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,7]]},"DOI":"10.1007\/s10107-018-1302-4","type":"journal-article","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T10:09:17Z","timestamp":1527588557000},"page":"237-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Theoretical challenges towards cutting-plane selection"],"prefix":"10.1007","volume":"170","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0294-8287","authenticated-orcid":false,"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"1302_CR1","unstructured":"Achterberg, T.: Exploiting degeneracy in MIP. In: Talk at Aussois 22nd Combinatorial Optimization Workshop. http:\/\/www.iasi.cnr.it\/aussois\/web\/uploads\/2018\/slides\/achterbergt.pdf (2018). Accessed 1 Feb 2018"},{"key":"1302_CR2","unstructured":"Achterberg, T.: LP basis selection and cutting planes. In: Talk at MIP. http:\/\/www2.isye.gatech.edu\/mip2010\/program\/program.pdf (2010). Accessed 1 Feb 2018"},{"key":"1302_CR3","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"1","key":"1302_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1302_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T Achterberg","year":"2010","unstructured":"Achterberg, T., Raack, C.: The MCF-separator: detecting and exploiting multi-commodity flow structures in MIPs. Math. Program. Comput. 2(2), 125\u2013165 (2010)","journal-title":"Math. Program. Comput."},{"key":"1302_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-006-0705-9","volume":"109","author":"A Agra","year":"2007","unstructured":"Agra, A., Constantino, M.F.: Lifting two-integer knapsack inequalities. Math. Program. 109, 115\u2013154 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1302_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR8","unstructured":"Alvarez, A.M., Wehenkel, L., Louveaux, Q.: Machine learning to balance the load in parallel branch-and-bound. http:\/\/hdl.handle.net\/2268\/181086 (2015). Accessed 1 Feb 2018"},{"issue":"1\u20132","key":"1302_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-012-0596-x","volume":"143","author":"E Amaldi","year":"2014","unstructured":"Amaldi, E., Coniglio, S., Gualandi, S.: Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1\u20132), 87\u2013110 (2014)","journal-title":"Math. Program."},{"key":"1302_CR10","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1287\/mnsc.1050.0382","volume":"51","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Reduce-and-split cuts: improving the performance of mixed integer Gomory cuts. Manage. Sci. 51, 1720\u20131732 (2005)","journal-title":"Manage. Sci."},{"key":"1302_CR11","doi-asserted-by":"crossref","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":"1302_CR12","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 30\u201342. Springer (2007)"},{"issue":"2","key":"1302_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding $$\\{0, 1\/2\\}$$-cuts in a branch-and-cut framework: a computational study. INFORMS J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10107-003-0390-x","volume":"96","author":"J Ar\u00e1oz","year":"2003","unstructured":"Ar\u00e1oz, J., Evans, L., Gomory, R.E., Johnson, E.L.: Cyclic groups and knapsack facets. Math. Program. 96, 377\u2013408 (2003)","journal-title":"Math. Program."},{"key":"1302_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98, 145\u2013175 (2003)","journal-title":"Math. Program."},{"key":"1302_CR16","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004)","journal-title":"Oper. Res."},{"issue":"2","key":"1302_CR17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-009-0265-x","volume":"123","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., G\u00fcnl\u00fck, O.: Mingling: mixed-integer rounding with bounds. Math. Program. 123(2), 315\u2013338 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"1302_CR18","doi-asserted-by":"crossref","first-page":"1943","DOI":"10.1137\/15M1033009","volume":"27","author":"A Atamt\u00fcrk","year":"2017","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S., Tezel, B.: Path cover and path pack inequalities for the capacitated fixed-charge network flow problem. SIAM J. Optim. 27(3), 1943\u20131976 (2017)","journal-title":"SIAM J. Optim."},{"key":"1302_CR19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Conflict graphs in integer programming. Eur. J. Oper. Res. 121, 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1302_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/130950173","volume":"30","author":"YH Au","year":"2016","unstructured":"Au, Y.H., Tun\u00e7el, L.: A comprehensive analysis of polyhedral lift-and-project methods. SIAM J. Discrete Math. 30(1), 411\u2013451 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"1302_CR21","unstructured":"Au, Y.H., Tun\u00e7el, L.: Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. ArXiv preprint arXiv:1608.07647 (2016)"},{"issue":"1\u20132","key":"1302_CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107-015-0865-6","volume":"154","author":"G Averkov","year":"2015","unstructured":"Averkov, G., Basu, A.: Lifting properties of maximal lattice-free polyhedra. Math. Program. 154(1\u20132), 81\u2013111 (2015)","journal-title":"Math. Program."},{"key":"1302_CR23","doi-asserted-by":"crossref","unstructured":"Averkov, G., Basu, A., Paat, J.: Approximation of corner polyhedra with families of intersection cuts. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 51\u201362. Springer (2017)","DOI":"10.1007\/978-3-319-59250-3_5"},{"issue":"2","key":"1302_CR24","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-014-0775-z","volume":"150","author":"Y Awate","year":"2015","unstructured":"Awate, Y., Cornu\u00e9jols, G., Guenin, B., Tun\u00e7el, L.: On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150(2), 459\u2013489 (2015)","journal-title":"Math. Program."},{"key":"1302_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2013a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"1302_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"1302_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"key":"1302_CR28","doi-asserted-by":"crossref","unstructured":"Balas, E., Bonami, P.: New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 89\u2013103. Springer (2007)","DOI":"10.1007\/978-3-540-72792-7_8"},{"key":"1302_CR29","doi-asserted-by":"crossref","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 integer 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"1302_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.: Gomory cuts revisited. Oper. Res. Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"9","key":"1302_CR31","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42(9), 1229\u20131246 (1996)","journal-title":"Manage. Sci."},{"key":"1302_CR32","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.: Strenghtening cuts for mixed integer programs. Eur. J. Oper. Res. 4, 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1302_CR33","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"137","author":"E Balas","year":"2013","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137(1), 19\u201335 (2013)","journal-title":"Math. Program."},{"key":"1302_CR34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift-and-project for mixed 0\u20131 programming: recent progress. Discrete Appl. Math. 123, 129\u2013154 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1302_CR35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E Balas","year":"1984","unstructured":"Balas, E., Zemel, E.: Facets of knapsack polytope from minimal covers. SIAM J. Appl. Math. 34, 119\u2013148 (1984)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"1302_CR36","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/ijoc.1100.0437","volume":"23","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: Experiments with two-row cuts from degenerate tableaux. INFORMS J. Comput. 23(4), 578\u2013590 (2011)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR37","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10107-009-0281-x","volume":"126","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: On the relative strength of split, triangle and qudrilateral cuts. Math. Program. 126, 281\u2013314 (2011)","journal-title":"Math. Program."},{"key":"1302_CR38","doi-asserted-by":"crossref","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, 704\u2013720 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1302_CR39","doi-asserted-by":"crossref","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":"1302_CR40","unstructured":"Basu, A., Conforti, M., Di\u00a0Summa, M.: Optimal cutting planes from the group relaxations. ArXiv preprint arXiv:1710.07672 (2017)"},{"issue":"2","key":"1302_CR41","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/moor.1110.0536","volume":"37","author":"A Basu","year":"2012","unstructured":"Basu, A., Cornu\u00e9jols, G., K\u00f6ppe, M.: Unique minimal liftings for simplicial polytopes. Math. Oper. Res. 37(2), 346\u2013355 (2012)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1302_CR42","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1287\/moor.1110.0522","volume":"37","author":"A Basu","year":"2012","unstructured":"Basu, A., Cornu\u00e9jols, G., Margot, F.: Intersection cuts with infinite split rank. Math. Oper. Res. 37(1), 21\u201340 (2012)","journal-title":"Math. Oper. Res."},{"key":"1302_CR43","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., Molinaro, M.: A probabilistic analysis of the strength of the split and triangle closures. In: IPCO, pp. 27\u201338. Springer (2011)","DOI":"10.1007\/978-3-642-20807-2_3"},{"issue":"1","key":"1302_CR44","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/moor.2014.0660","volume":"40","author":"A Basu","year":"2014","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Equivariant perturbation in Gomory and Johnson\u2019s infinite group problem. I. The one-dimensional case. Math. Oper. Res. 40(1), 105\u2013129 (2014)","journal-title":"Math. Oper. Res."},{"key":"1302_CR45","doi-asserted-by":"crossref","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14(1), 1\u201340 (2016)","DOI":"10.1007\/s10288-015-0292-9"},{"key":"1302_CR46","doi-asserted-by":"crossref","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2), 107\u2013131 (2016)","DOI":"10.1007\/s10288-015-0293-8"},{"issue":"2","key":"1302_CR47","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/110848608","volume":"23","author":"A Basu","year":"2013","unstructured":"Basu, A., Hildebrand, R., Koppe, M., Molinaro, M.: A $$(k+1)$$-slope theorem for the $$k$$-dimensional infinite group relaxation. SIAM J. Optim. 23(2), 1021\u20131040 (2013)","journal-title":"SIAM J. Optim."},{"key":"1302_CR48","doi-asserted-by":"crossref","unstructured":"Basu, A., Hildebrand, R., Molinaro, M.: Minimal cut-generating functions are nearly extreme. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 202\u2013213. Springer (2016)","DOI":"10.1007\/978-3-319-33461-5_17"},{"issue":"4","key":"1302_CR49","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1137\/140990413","volume":"25","author":"A Basu","year":"2015","unstructured":"Basu, A., Paat, J.: Operations that preserve the covering property of the lifting region. SIAM J. Optim. 25(4), 2313\u20132333 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1302_CR50","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-016-1064-9","volume":"163","author":"A Basu","year":"2017","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Equivariant perturbation in gomory and johnson\u2019s infinite group problem\u2013III: foundations for the $$k$$-dimensional case with applications to $$k=2$$. Math. Program. 163(1), 301\u2013358 (2017)","journal-title":"Math. Program."},{"key":"1302_CR51","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.25.3.419","volume":"25","author":"DF Bell","year":"1977","unstructured":"Bell, D.F., Shapiro, J.F.: A convergent duality theory for integer programming. Oper. Res. 25, 419\u2013434 (1977)","journal-title":"Oper. Res."},{"key":"1302_CR52","doi-asserted-by":"crossref","unstructured":"Benchetrit, Y., Fiorini, S., Huynh, T., Weltge, S.: Characterizing polytopes in the 0\/1-cube with bounded chv\u00e1tal-gomory rank. Math. Oper. Res. (2018). https:\/\/doi.org\/10.1287\/moor.2017.0880","DOI":"10.1287\/moor.2017.0880"},{"issue":"1","key":"1302_CR53","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D Bienstock","year":"2004","unstructured":"Bienstock, D., Zuckerberg, M.: Subset algebra lift operators for 0\u20131 integer programming. SIAM J. Optim. 15(1), 63\u201395 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1302_CR54","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/ijoc.2016.0717","volume":"29","author":"M Bodur","year":"2017","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O., Luedtke, J.: Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS J. Comput. 29(1), 77\u201391 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20132","key":"1302_CR55","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-016-1005-7","volume":"161","author":"M Bodur","year":"2017","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O.: Cutting planes from extended LP formulations. Math. Program. 161(1\u20132), 159\u2013192 (2017)","journal-title":"Math. Program."},{"key":"1302_CR56","doi-asserted-by":"publisher","unstructured":"Bodur, M., Del\u00a0Pia, A., Dey, S.S., Molinaro, M., Pokutta, S.: Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. (2017). https:\/\/doi.org\/10.1007\/s10107-017-1192-x","DOI":"10.1007\/s10107-017-1192-x"},{"key":"1302_CR57","doi-asserted-by":"crossref","unstructured":"Bodur, M., Del\u00a0Pia, A., Dey, S.S., Molinaro, M.: Lower bounds on the lattice-free rank for packing and covering integer programs. ArXiv preprint arXiv:1710.00031 (2017)","DOI":"10.1007\/s10107-017-1192-x"},{"issue":"2","key":"1302_CR58","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012)","journal-title":"Math. Program. Comput."},{"key":"1302_CR59","unstructured":"Bonami, P., Lodi, A., Zarpellon, G.: Learning a classification of mixed-integer quadratic programming problems. http:\/\/cerc-datascience.polymtl.ca\/wp-content\/uploads\/2018\/01\/Technical-Report_DS4DM-2017-013.pdf (2017). Accessed 1 Feb 2018"},{"key":"1302_CR60","doi-asserted-by":"crossref","unstructured":"Bonami, P., Margot, F.: Cut generation through binarization. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 174\u2013185. Springer (2014)","DOI":"10.1007\/978-3-319-07557-0_15"},{"issue":"4","key":"1302_CR61","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P Bonami","year":"2005","unstructured":"Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0\u20131 MIPs, a computational investigation. Discrete Optim. 2(4), 288\u2013307 (2005)","journal-title":"Discrete Optim."},{"key":"1302_CR62","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34, 538\u2013546 (2009)","journal-title":"Math. Oper. Res."},{"key":"1302_CR63","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. OUP, Oxford (2013)"},{"issue":"2","key":"1302_CR64","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10107-008-0245-6","volume":"122","author":"F Cadoux","year":"2010","unstructured":"Cadoux, F.: Computing deep facet-defining disjunctive cuts for mixed-integer programming. Math. Program. 122(2), 197\u2013223 (2010)","journal-title":"Math. Program."},{"key":"1302_CR65","first-page":"221","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{ 0,\\frac{1}{2} \\}$$\u2013Chv\u00e1tal-Gomory cuts. Math. Program. 74, 221\u2013235 (1996)","journal-title":"Math. Program."},{"key":"1302_CR66","unstructured":"Car\u00f8e, C.C.: Decomposition in Stochastic Integer Programming. Ph.D. thesis, Institute of Mathematical Sciences, Department of Operations Research, University of Copenhagen, Denmark (1998)"},{"key":"1302_CR67","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)"},{"issue":"1","key":"1302_CR68","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/moor.2015.0714","volume":"41","author":"K Chandrasekaran","year":"2016","unstructured":"Chandrasekaran, K., V\u00e9gh, L.A., Vempala, S.S.: The cutting plane method is polynomial for perfect matchings. Math. Oper. Res. 41(1), 23\u201348 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1302_CR69","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/opre.1100.0882","volume":"59","author":"B Chen","year":"2011","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: Finite disjunctive programming characterizations for general mixed-integer linear programs. Oper. Res. 59(1), 202\u2013210 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"1302_CR70","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.orl.2011.10.009","volume":"40","author":"B Chen","year":"2012","unstructured":"Chen, B., K\u00fc\u00e7\u00fckyavuz, S., Sen, S.: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. Oper. Res. Lett. 40(1), 15\u201319 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1302_CR71","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/moor.1060.0212","volume":"32","author":"KKH Cheung","year":"2007","unstructured":"Cheung, K.K.H.: Computation of the lasserre ranks of some polytopes. Math. Oper. Res. 32(1), 88\u201394 (2007)","journal-title":"Math. Oper. Res."},{"issue":"115","key":"1302_CR72","doi-asserted-by":"crossref","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., Hartmann, M.: On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114(115), 455\u2013499 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1302_CR73","doi-asserted-by":"crossref","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":"1302_CR74","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-12914-6","volume-title":"Large Sparse Numerical Optimization, volume 165 of Lecture Notes in Computer Science","author":"TF Coleman","year":"1984","unstructured":"Coleman, T.F.: Large Sparse Numerical Optimization, volume 165 of Lecture Notes in Computer Science, vol. 165. Springer, Berlin (1984)"},{"issue":"2","key":"1302_CR75","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/moor.2014.0670","volume":"40","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-generating functions and s-free sets. Math. Oper. Res. 40(2), 276\u2013391 (2014)","journal-title":"Math. Oper. Res."},{"key":"1302_CR76","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2009","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: A geometric perspective on lifting. Oper. Res. 59, 569\u2013577 (2009)","journal-title":"Oper. Res."},{"key":"1302_CR77","volume-title":"Integer Programming","author":"M Conforti","year":"2012","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2012)"},{"issue":"1\u20132","key":"1302_CR78","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10107-015-0883-4","volume":"154","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Del Pia, A., Di Summa, M., Faenza, Y.: Reverse split rank. Math. Program. 154(1\u20132), 273\u2013303 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1302_CR79","doi-asserted-by":"crossref","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-Gomory rank. SIAM J. Discrete Math. 29(1), 166\u2013181 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1302_CR80","unstructured":"Conforti, M., Wolsey, L.A.: \u201cFacet\u201d Separation with One Linear Program. Technical report, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2016)"},{"key":"1302_CR81","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-319-20086-6_8","volume-title":"Experimental Algorithms","author":"S Coniglio","year":"2015","unstructured":"Coniglio, S., Tieves, M.: On the generation of cutting planes which maximize the bound improvement. In: Bampis, E. (ed.) Experimental Algorithms, pp. 97\u2013109. Springer, Cham (2015)"},{"issue":"1\u20133","key":"1302_CR82","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01580849","volume":"47","author":"W Cook","year":"1990","unstructured":"Cook, W.: Cutting-plane proofs in polynomial space. Math. Program. 47(1\u20133), 11\u201318 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"1302_CR83","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W Cook","year":"2001","unstructured":"Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. Math. Oper. Res. 26(1), 19\u201330 (2001)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1302_CR84","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W Cook","year":"2009","unstructured":"Cook, W., Dash, S., Fukasawa, R., Goycoolea, M.: Numerically safe gomory mixed-integer cuts. INFORMS J. Comput. 21(4), 641\u2013649 (2009)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR85","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"58","author":"W Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 58, 155\u2013174 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"1302_CR86","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s12532-013-0055-6","volume":"5","author":"W Cook","year":"2013","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3), 305\u2013344 (2013)","journal-title":"Math. Program. Comput."},{"key":"1302_CR87","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-006-0100-1","volume":"149","author":"G Cornu\u00e9jols","year":"2007","unstructured":"Cornu\u00e9jols, G.: Revival of the Gomory cuts in the 1990\u2019s. Ann. Oper. Res. 149, 63\u201366 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1302_CR88","doi-asserted-by":"crossref","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."},{"issue":"3","key":"1302_CR89","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Lemar\u00e9chal, C.: A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3), 567\u2013586 (2006)","journal-title":"Math. Program."},{"key":"1302_CR90","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Corn\u00faejols","year":"2001","unstructured":"Corn\u00faejols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR91","doi-asserted-by":"crossref","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\u20131 polyhedra. Math. Program. 91, 391\u2013397 (2002)","journal-title":"Math. Program."},{"key":"1302_CR92","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1287\/ijoc.15.4.385.24893","volume":"15","author":"G Cornu\u00e9jols","year":"2003","unstructured":"Cornu\u00e9jols, G., Li, Y., Vandenbussche, D.: K-cuts: a variation of gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15, 385\u2013396 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"1302_CR93","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s12532-013-0057-4","volume":"5","author":"G Cornu\u00e9jols","year":"2013","unstructured":"Cornu\u00e9jols, G., Margot, F., Nannicini, G.: On the safety of gomory cut generators. Math. Program. Comput. 5(4), 345\u2013395 (2013)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1302_CR94","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.disopt.2012.02.004","volume":"9","author":"G Cornu\u00e9jols","year":"2012","unstructured":"Cornu\u00e9jols, G., Michini, C., Nannicini, G.: How tight is the corner relaxation? Insights gained from the stable set problem. Discrete Optim. 9(2), 109\u2013121 (2012)","journal-title":"Discrete Optim."},{"key":"1302_CR95","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Lee, D.L.: On some polytopes contained in the 0, 1 hypercube that have a small Chv\u00e1tal rank. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 300\u2013311. Springer (2016)","DOI":"10.1007\/978-3-319-33461-5_25"},{"issue":"1","key":"1302_CR96","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10107-012-0562-7","volume":"142","author":"G Cornu\u00e9jols","year":"2013","unstructured":"Cornu\u00e9jols, G., Molinaro, M.: A 3-slope theorem for the infinite relaxation in the plane. Math. Program. 142(1), 83\u2013105 (2013)","journal-title":"Math. Program."},{"key":"1302_CR97","doi-asserted-by":"crossref","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.W.: Solving large scale zero-one linear programming problem. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"1302_CR98","first-page":"678","volume":"30","author":"S Dash","year":"2005","unstructured":"Dash, S.: Exponential lower bounds on the lengths of some classes of branch-and-cut proofs. Naval Res. Logist. 30, 678\u2013700 (2005)","journal-title":"Naval Res. Logist."},{"issue":"1\u20132","key":"1302_CR99","doi-asserted-by":"crossref","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(1\u20132), 221\u2013254 (2012)","journal-title":"Math. Program."},{"issue":"3\u20134","key":"1302_CR100","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s12532-010-0018-0","volume":"2","author":"S Dash","year":"2010","unstructured":"Dash, S., Goycoolea, M.: A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3\u20134), 231\u2013257 (2010)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1302_CR101","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.1090.0337","volume":"22","author":"S Dash","year":"2010","unstructured":"Dash, S., Goycoolea, M., G\u00fcnl\u00fck, O.: Two-step MIR inequalities for mixed integer programs. INFORMS J. Comput. 22(2), 236\u2013249 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1302_CR102","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S Dash","year":"2006","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1), 29\u201353 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1302_CR103","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1137\/080735473","volume":"20","author":"S Dash","year":"2009","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On mixing inequalities: rank, closure, and cutting-plane proofs. SIAM J. Optim. 20(2), 1090\u20131109 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1302_CR104","doi-asserted-by":"crossref","first-page":"591","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(1\u20132), 591\u2013599 (2013)","journal-title":"Math. Program."},{"key":"1302_CR105","doi-asserted-by":"crossref","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":"4","key":"1302_CR106","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/ijoc.2014.0598","volume":"26","author":"S Dash","year":"2014","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26(4), 780\u2013797 (2014)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR107","first-page":"1","volume":"31","author":"S Dash","year":"2011","unstructured":"Dash, S.: Mixed integer rounding cuts and master group polyhedra. Comb. Optim. Methods Appl. 31, 1\u201332 (2011)","journal-title":"Comb. Optim. Methods Appl."},{"issue":"5","key":"1302_CR108","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.orl.2011.06.010","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5), 305\u2013309 (2011)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR109","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-011-0476-9","volume":"135","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: On convergence in mixed integer programming. Math. Program. 135, 397\u2013412 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"1302_CR110","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1287\/moor.1110.0527","volume":"37","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A.: On the rank of disjunctive cuts. Math. Oper. Res. 37(2), 372\u2013378 (2012)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1302_CR111","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107-009-0329-y","volume":"130","author":"SS Dey","year":"2011","unstructured":"Dey, S.S.: A note on the split rank of intersection cuts. Math. Program. 130(1), 107\u2013124 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"1302_CR112","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.orl.2015.03.007","volume":"43","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Iroume, A., Molinaro, M.: Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43(3), 323\u2013328 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR113","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Iroume, A., Wang, G.: The strength of multi-row aggregation cuts for sign-pattern integer programs. ArXiv preprint arXiv:1711.06963 (2017)","DOI":"10.1016\/j.orl.2018.11.001"},{"key":"1302_CR114","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Lodi, A., Wolsey, L.A., Tramontani, A.: Experiments with two row tableau cuts. In: Eisenbrand, F., Shepherd, B. (eds.) Proceedings 14th Conference on Integer Programming and Combinatorial Optimization, pp. 424\u2013437. Springer (2010)","DOI":"10.1007\/978-3-642-13036-6_32"},{"issue":"3","key":"1302_CR115","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1287\/moor.1110.0496","volume":"36","author":"SS Dey","year":"2011","unstructured":"Dey, S.S., Louveaux, Q.: Split rank of triangle and quadrilateral inequalities. Math. Oper. Res. 36(3), 432\u2013461 (2011)","journal-title":"Math. Oper. Res."},{"key":"1302_CR116","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs. Math. Oper. Res 43(1), 304\u2013332 (2018)"},{"key":"1302_CR117","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-015-0925-y","volume":"154","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Approximating polyhedra with sparse inequalities. Math. Program. 154, 329\u2013352 (2015)","journal-title":"Math. Program."},{"key":"1302_CR118","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/moor.1070.0283","volume":"33","author":"SS Dey","year":"2008","unstructured":"Dey, S.S., Richard, J.-P.P.: Facets of the two-dimensional infinite group problems. Math. Oper. Res. 33, 140\u2013166 (2008)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1302_CR119","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-009-0303-8","volume":"123","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Richard, J.-P.P.: Relations between facets of low-and high-dimensional group problems. Math. Program. 123(2), 285\u2013313 (2010)","journal-title":"Math. Program."},{"key":"1302_CR120","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-008-0229-6","volume":"121","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Richard, J.-P.P., Li, Y., Miller, L.A.: On the extreme inequalities of infinite group problems. Math. Program. 121, 145\u2013170 (2010)","journal-title":"Math. Program."},{"key":"1302_CR121","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.disopt.2010.06.001","volume":"7","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Composite lifting of group inequalities and an application to two-row mixing inequalities. Discrete Optim. 7, 256\u2013268 (2010)","journal-title":"Discrete Optim."},{"key":"1302_CR122","doi-asserted-by":"crossref","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20, 2890\u20132912 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1302_CR123","first-page":"143","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Program. 124(1\u20132), 143\u2013174 (2010)","journal-title":"Math. Program."},{"key":"1302_CR124","doi-asserted-by":"crossref","unstructured":"Espinoza, D.: Computing with multiple-row Gomory cuts. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) Proceedings 13th Conference on Integer Programming and Combinatorial Optimization, pp. 214\u2013224. Springer (2008)","DOI":"10.1007\/978-3-540-68891-4_15"},{"key":"1302_CR125","doi-asserted-by":"crossref","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":"2","key":"1302_CR126","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s12532-011-0024-x","volume":"3","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Salvagnin, D.: A relax-and-cut framework for gomory mixed-integer cuts. Math. Program. Comput. 3(2), 79\u2013102 (2011)","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"1302_CR127","doi-asserted-by":"crossref","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":"4","key":"1302_CR128","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/04061831X","volume":"20","author":"C Gentile","year":"2006","unstructured":"Gentile, C., Ventura, P., Weismantel, R.: Mod-2 cuts generation yields the convex hull of bounded integer feasible sets. SIAM J. Discrete Math. 20(4), 913\u2013919 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1302_CR129","unstructured":"Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J.T., Witzig, J.: The SCIP optimization suite 5.0. Technical Report 17-61, ZIB, Takustr.7, 14195 Berlin (2017)"},{"key":"1302_CR130","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":"1302_CR131","doi-asserted-by":"crossref","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":"1302_CR132","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, RAND Corporation (1960)"},{"key":"1302_CR133","doi-asserted-by":"crossref","first-page":"341","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, 341\u2013375 (1969)","journal-title":"Linear Algebra Appl."},{"key":"1302_CR134","doi-asserted-by":"crossref","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":"1302_CR135","doi-asserted-by":"crossref","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":"1302_CR136","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10107-003-0389-3","volume":"96","author":"RE Gomory","year":"2003","unstructured":"Gomory, R.E., Johnson, E.L.: T-space and cutting planes. Math. Program. 96, 341\u2013375 (2003)","journal-title":"Math. Program."},{"key":"1302_CR137","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-003-0388-4","volume":"96","author":"RE Gomory","year":"2003","unstructured":"Gomory, R.E., Johnson, E.L., Evans, L.: Corner polyhedra and their connection with cutting planes. Math. Program. 96, 321\u2013339 (2003)","journal-title":"Math. Program."},{"key":"1302_CR138","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0\u20131 integer programs. Math. Program. 85, 439\u2013467 (1999)","journal-title":"Math. Program."},{"key":"1302_CR139","unstructured":"Guerrero-Gar\u0107ia, P.: Range-Space Methods for Sparse Linear Programs. Ph.D. thesis, Department of Applied Mathematics, University of Malaga, Spain (2002)"},{"key":"1302_CR140","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90, 429\u2013457 (2001)","journal-title":"Math. Program."},{"issue":"3","key":"1302_CR141","first-page":"118","volume":"4","author":"M Guzelsoy","year":"2007","unstructured":"Guzelsoy, M., Ralphs, T.K.: Duality for mixed-integer linear programs. Int. J. Oper. Res. 4(3), 118\u2013137 (2007)","journal-title":"Int. J. Oper. Res."},{"issue":"1","key":"1302_CR142","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"PL Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facet of regular 0\u20131 polytopes. Math. Program. 8(1), 179\u2013206 (1975)","journal-title":"Math. Program."},{"key":"1302_CR143","unstructured":"He, H., Daum\u00e9 III, H., Eisner, J.: Learning to search in branch-and-bound algorithms. In: Proceedings of the 27th International Conference on Neural Information Processing Systems Volume 2, NIPS\u201914, pp. 3293\u20133301. MIT Press, Cambridge, MA, USA (2014)"},{"issue":"3","key":"1302_CR144","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/100797254","volume":"21","author":"Q He","year":"2011","unstructured":"He, Q., Ahmed, S., Nemhauser, G.L.: A probabilistic comparison of split and type 1 triangle cuts for two-row mixed-integer programs. SIAM J. Optim. 21(3), 617\u2013632 (2011)","journal-title":"SIAM J. Optim."},{"key":"1302_CR145","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"KL Hoffman","year":"1991","unstructured":"Hoffman, K.L., Padberg, M.: Improving LP-representation of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3, 121\u2013134 (1991)","journal-title":"ORSA J. Comput."},{"key":"1302_CR146","unstructured":"Hutter, F., Hoos, H.\u00a0H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14\u201318, 2010. Proceedings, pp. 186\u2013202 (2010)"},{"issue":"2","key":"1302_CR147","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"R Jeroslow","year":"1978","unstructured":"Jeroslow, R.: Cutting-plane theory: algebraic methods. Discrete Math. 23(2), 121\u2013150 (1978)","journal-title":"Discrete Math."},{"issue":"1","key":"1302_CR148","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01588222","volume":"17","author":"RG Jeroslow","year":"1979","unstructured":"Jeroslow, R.G.: Minimal inequalities. Math. Program. 17(1), 1\u201315 (1979)","journal-title":"Math. Program."},{"key":"1302_CR149","doi-asserted-by":"crossref","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"},{"key":"1302_CR150","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0167-5060(08)70345-5","volume":"5","author":"EL Johnson","year":"1979","unstructured":"Johnson, E.L.: On the group problem and a subadditive approach to integer programming. Ann. Discrete Math. 5, 97\u2013112 (1979)","journal-title":"Ann. Discrete Math."},{"key":"1302_CR151","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0120925","volume":"14","author":"EL Johnson","year":"1981","unstructured":"Johnson, E.L.: Characterization of facets for multiple right-hand side choice linear programs. Math. Program. Study 14, 112\u2013142 (1981)","journal-title":"Math. Program. Study"},{"key":"1302_CR152","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"EL Johnson","year":"2000","unstructured":"Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2\u201323 (2000)","journal-title":"INFORMS J. Comput."},{"key":"1302_CR153","first-page":"169","volume":"16","author":"EL Johnson","year":"1982","unstructured":"Johnson, E.L., Padberg, M.W.: Degree-two inequalities, clique facets and biperfect graphs. Ann. Discrete Math. 16, 169\u2013187 (1982)","journal-title":"Ann. Discrete Math."},{"key":"1302_CR154","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Bodic, P.L., Song, L., Nemhauser, G.L., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI\u201916, pp. 724\u2013731. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"issue":"2","key":"1302_CR155","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H.D., Ralphs, T.K., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1302_CR156","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.orl.2015.06.004","volume":"43","author":"M K\u00f6ppe","year":"2015","unstructured":"K\u00f6ppe, M., Zhou, Y.: An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem. Oper. Res. Lett. 43(4), 438\u2013444 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1302_CR157","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s12532-016-0115-9","volume":"9","author":"M K\u00f6ppe","year":"2017","unstructured":"K\u00f6ppe, M., Zhou, Y.: New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem. Math. Program. Comput. 9(3), 419\u2013469 (2017)","journal-title":"Math. Program. Comput."},{"key":"1302_CR158","doi-asserted-by":"crossref","unstructured":"K\u00f6ppe, M., Zhou, Y.: On the notions of facets, weak facets, and extreme functions of the Gomory\u2013Johnson infinite group problem. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 330\u2013342. Springer (2017)","DOI":"10.1007\/978-3-319-59250-3_27"},{"key":"1302_CR159","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-319-59776-8_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Kruber","year":"2017","unstructured":"Kruber, M., L\u00fcbbecke, M.E., Parmentier, A.: Learning when to use a decomposition. In: Salvagnin, D., Lombardi, M. (eds.) Integration of AI and OR Techniques in Constraint Programming, pp. 202\u2013210. Springer International Publishing, Cham (2017)"},{"key":"1302_CR160","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.2016.0797","volume":"42","author":"A Kurpisz","year":"2017","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: On the hardest problem formulations for the 0\/1 lasserre hierarchy. Math. Oper. Res. 42, 135\u2013143 (2017)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1302_CR161","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1302_CR162","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"1302_CR163","unstructured":"Lebair, T.M., Basu, A.: Approximation of minimal functions by extreme functions. ArXiv preprint arXiv:1708.04344 (2017)"},{"issue":"2","key":"1302_CR164","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"AN Letchford","year":"2002","unstructured":"Letchford, A.N., Lodi, A.: Strengthening Chv\u00e1tal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2), 74\u201382 (2002)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR165","doi-asserted-by":"crossref","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":"1302_CR166","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-642-21311-3_13","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Lodi","year":"2011","unstructured":"Lodi, A., Pesant, G., Rousseau, L.-M.: On counting lattice points and Chv\u00e1tal-Gomory cutting planes. In: Achterberg, T., Beck, J.C. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 131\u2013136. Springer, Berlin (2011)"},{"issue":"2","key":"1302_CR167","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017)","journal-title":"TOP"},{"issue":"1\u20132","key":"1302_CR168","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10107-012-0597-9","volume":"143","author":"Q Louveaux","year":"2014","unstructured":"Louveaux, Q., Poirrier, L.: An algorithm for the separation of two-row cuts. Math. Program. 143(1\u20132), 111\u2013146 (2014)","journal-title":"Math. Program."},{"key":"1302_CR169","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developments and Applications, pp. 177\u2013210. Kluwer, Dordrecht (1989)"},{"key":"1302_CR170","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schirjver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"1302_CR171","doi-asserted-by":"crossref","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":"1302_CR172","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"1302_CR173","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12532-009-0003-7","volume":"1","author":"F Margot","year":"2009","unstructured":"Margot, F.: Testing cut generators for mixed-integer linear programming. Math. Program. Comput. 1(1), 69\u201395 (2009)","journal-title":"Math. Program. Comput."},{"key":"1302_CR174","doi-asserted-by":"crossref","unstructured":"Mastrolilli, M.: High degree sum of squares proofs, Bienstock\u2013Zuckerberg hierarchy and CG cuts. In: Eisenbrand, F., K\u00f6nemann, J. (eds) Integer Programming and Combinatorial Optimization\u201419th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26\u201328, 2017, Proceedings, volume 10328 of Lecture Notes in Computer Science, pp. 405\u2013416. Springer (2017)","DOI":"10.1007\/978-3-319-59250-3_33"},{"issue":"2","key":"1302_CR175","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1002\/nav.20275","volume":"55","author":"LA Miller","year":"2008","unstructured":"Miller, L.A., Li, Y., Richard, J.-P.P.: New inequalities for finite and infinite group problems from approximate lifting. Naval Res. Logist. 55(2), 172\u2013191 (2008)","journal-title":"Naval Res. Logist."},{"key":"1302_CR176","unstructured":"Molinaro, M.: Understanding the Strength of General-Purpose Cutting Planes. Ph.D. thesis, Carnegie Mellon University (2013)"},{"issue":"3","key":"1302_CR177","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/110840868","volume":"22","author":"DA Mor\u00e1n","year":"2012","unstructured":"Mor\u00e1n, D.A., Dey, S.S., Vielma, J.P.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22(3), 1136\u20131150 (2012)","journal-title":"SIAM J. Optim."},{"key":"1302_CR178","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-642-21311-3_15","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G Nannicini","year":"2011","unstructured":"Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., W\u00e4chter, A.: A probing algorithm for MINLP with failure prediction by SVM. In: Achterberg, T., Beck, J.C. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 154\u2013169. Springer, Berlin (2011)"},{"key":"1302_CR179","doi-asserted-by":"crossref","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":"1302_CR180","doi-asserted-by":"crossref","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."},{"issue":"6","key":"1302_CR181","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.orl.2012.10.003","volume":"40","author":"J Neto","year":"2012","unstructured":"Neto, J.: A simple finite cutting plane algorithm for integer programs. Oper. Res. Lett. 40(6), 578\u2013580 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1302_CR182","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen, J.H., Mehrotra, S.: A disjunctive cutting plane procedure for general mixed-integer linear programs. Math. Program. 89(3), 437\u2013448 (2001)","journal-title":"Math. Program."},{"key":"1302_CR183","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"1302_CR184","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1137\/0905041","volume":"5","author":"MA Saunders","year":"1984","unstructured":"Saunders, M.A., Wright, M.H., Gill, P.E., Murray, W.: Sparse matrix methods in optimization. SIAM J. Sci. Stat. Comput. 5, 562\u2013589 (1984)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"1302_CR185","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.orl.2011.04.005","volume":"39","author":"AD Pia","year":"2011","unstructured":"Pia, A.D., Wagner, C., Weismantel, R.: A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. Oper. Res. Lett. 39(4), 234\u2013240 (2011)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR186","doi-asserted-by":"crossref","unstructured":"Pokutta, S., Schulz, A.S.: On the rank of cutting-plane proof systems. In: IPCO, pp. 450\u2013463. Springer (2010)","DOI":"10.1007\/978-3-642-13036-6_34"},{"issue":"3","key":"1302_CR187","doi-asserted-by":"crossref","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-Gomory rank in the 0\/1 cube. Oper. Res. Lett. 39(3), 200\u2013203 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1302_CR188","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log. 62(3), 981\u2013998 (1997)","journal-title":"J. Symb. Log."},{"key":"1302_CR189","volume-title":"The Group-theoretic Approach in Mixed Integer Programming, Chapter 19","author":"J-PP Richard","year":"2010","unstructured":"Richard, J.-P.P., Dey, S.S.: The Group-theoretic Approach in Mixed Integer Programming, Chapter 19. Springer, Berlin (2010)"},{"key":"1302_CR190","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-007-0190-9","volume":"118","author":"J-PP Richard","year":"2009","unstructured":"Richard, J.-P.P., Li, Y., Miller, L.A.: Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Program. 118, 253\u2013277 (2009)","journal-title":"Math. Program."},{"key":"1302_CR191","unstructured":"Rothvo\u00df, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP. Tutorial. https:\/\/sites.math.washington.edu\/~rothvoss\/lecturenotes\/lasserresurvey.pdf (2013). Accessed 1 Feb 2018"},{"issue":"1","key":"1302_CR192","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/opre.2016.1549","volume":"65","author":"T Rothvo\u00df","year":"2017","unstructured":"Rothvo\u00df, T., Sanit\u00e0, L.: 0\/1 polytopes with quadratic Chv\u00e1tal rank. Oper. Res. 65(1), 212\u2013220 (2017)","journal-title":"Oper. Res."},{"issue":"4","key":"1302_CR193","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.disopt.2012.07.003","volume":"9","author":"S Sanjeevi","year":"2012","unstructured":"Sanjeevi, S., Kianfar, K.: Mixed n-step MIR inequalities: facets for the n-mixing set. Discrete Optim. 9(4), 216\u2013235 (2012)","journal-title":"Discrete Optim."},{"key":"1302_CR194","unstructured":"Schrijver, A.: On cutting planes. Ann. Discrete Math. 9, 291\u2013296 (1980). Combinatorics 79 (Proc. Colloq., Univ. Montr\u00e9al, Montreal, Que., 1979), Part II"},{"issue":"1","key":"1302_CR195","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S Sen","year":"2005","unstructured":"Sen, S., Higle, J.: The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: set convexification. Math. Program. 104(1), 1\u201320 (2005)","journal-title":"Math. Program."},{"key":"1302_CR196","first-page":"411","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Optim. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Optim."},{"key":"1302_CR197","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discr. Appl. Math. 52, 83\u2013106 (1994)","journal-title":"Discr. Appl. Math."},{"key":"1302_CR198","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0166-218X(99)00225-5","volume":"101","author":"HD Sherali","year":"2000","unstructured":"Sherali, H.D., Smith, J.C., Adams, W.P.: Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discr. Appl. Math. 101, 247\u2013267 (2000)","journal-title":"Discr. Appl. Math."},{"key":"1302_CR199","doi-asserted-by":"crossref","unstructured":"Singh, M., Talwar, K.: Improving integrality gaps via Chv\u00e1tal\u2013Gomory rounding. In: APPROX-RANDOM, pp. 366\u2013379. Springer (2010)","DOI":"10.1007\/978-3-642-15369-3_28"},{"issue":"2","key":"1302_CR200","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"TJ Van Roy","year":"1986","unstructured":"Van Roy, T.J., Wolsey, L.A.: Valid inequalities for mixed 0\u20131 programs. Discrete Appl. Math. 14(2), 199\u2013213 (1986)","journal-title":"Discrete Appl. Math."},{"key":"1302_CR201","doi-asserted-by":"crossref","unstructured":"Walter, M.: Sparsity of lift-and-project cutting planes. In: Operations Research Proceedings 2012, pp. 9\u201314. Springer (2014)","DOI":"10.1007\/978-3-319-00795-3_2"},{"issue":"3","key":"1302_CR202","doi-asserted-by":"crossref","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":"1302_CR203","unstructured":"Wesselmann, F., Suhl, U.H.: Implementing cutting plane management and selection techniques. Technical report, University of Paderborn, December (2012)"},{"key":"1302_CR204","doi-asserted-by":"crossref","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."},{"issue":"3","key":"1302_CR205","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","volume":"8","author":"LA Wolsey","year":"1989","unstructured":"Wolsey, L.A.: Submodularity and valid inequalities in capacitated fixed charge networks. Oper. Res. Lett. 8(3), 119\u2013124 (1989)","journal-title":"Oper. Res. Lett."},{"key":"1302_CR206","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"1302_CR207","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed-integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI) (2011)"},{"issue":"4","key":"1302_CR208","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1287\/moor.2016.0781","volume":"41","author":"S Yildiz","year":"2016","unstructured":"Yildiz, S., Cornu\u00e9jols, G.: Cut-generating functions for integer variables. Math. Oper. Res. 41(4), 1381\u20131403 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1302_CR209","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10107-009-0335-0","volume":"130","author":"A Zanette","year":"2011","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: Can a pure cutting plane algorithm work? Math. Program. 130(1), 153\u2013176 (2011)","journal-title":"Math. Program."},{"key":"1302_CR210","doi-asserted-by":"crossref","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, 268\u2013277 (1978)","journal-title":"Math. Program."},{"key":"1302_CR211","doi-asserted-by":"crossref","unstructured":"Zhang, M., K\u00fc\u00e7\u00fckyavuz, S.: Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J. Optim. 24(4), 1933\u20131951","DOI":"10.1137\/13092678X"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1302-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1302-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1302-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T21:31:34Z","timestamp":1693690294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1302-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":211,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1302"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1302-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"1 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}