{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T13:14:44Z","timestamp":1683897284612},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T00:00:00Z","timestamp":1442534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10479-015-2024-0","type":"journal-article","created":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T11:13:12Z","timestamp":1442574792000},"page":"95-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Relaxations of mixed integer sets from lattice-free polyhedra"],"prefix":"10.1007","volume":"240","author":[{"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,18]]},"reference":[{"key":"2024_CR1","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. (2005). Split closure and intersection cuts. Mathematical Programming A, 102, 457\u2013493.","journal-title":"Mathematical Programming A"},{"key":"2024_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., & Weismantel, R. (2010). An analysis of mixed integer linear sets based on lattice point free convex sets. Mathematics of Operations Research, 35, 233\u2013256.","journal-title":"Mathematics of Operations Research"},{"key":"2024_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., & Wolsey, L. A. (2007). Cutting planes from two rows of a simplex tableau. In Proceedings of IPCO, lecture notes in computer science (vol. 4513, pp. 1\u201315).","DOI":"10.1007\/978-3-540-72792-7_1"},{"issue":"4","key":"2024_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.disopt.2012.06.003","volume":"9","author":"G Averkov","year":"2012","unstructured":"Averkov, G. (2012). On finitely generated closures in the theory of cutting planes. Discrete Optimization, 9(4), 209\u2013215.","journal-title":"Discrete Optimization"},{"key":"2024_CR5","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G Averkov","year":"2011","unstructured":"Averkov, G., Wagner, C., & Weismantel, R. (2011). Maximal lattice-free polyhedra: Finiteness and an explicit description in dimension three. Mathematics of Operations Research, 36, 721\u2013742.","journal-title":"Mathematics of Operations Research"},{"key":"2024_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E. (1971). Intersection cuts\u2014A new type of cutting planes for integer programming. Operations Research, 19, 19\u201339.","journal-title":"Operations Research"},{"key":"2024_CR7","unstructured":"Balas, E. (1974). Disjunctive programming: Properties of the convex hull of feasible points. GSIA Management Science Research Report MSRR 348, Carnegie Mellon University 1974. Published as invited paper in Discrete Applied Mathematics, 89(3\u201344), 1998."},{"key":"2024_CR8","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. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"2024_CR9","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E. (1985). Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods, 6, 466\u2013486.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"2024_CR10","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. (1993). A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Mathematical Programming, 58, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"2024_CR11","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. (2013). Generalized intersection cuts and a new cut generating paradigm. Mathematical Programming A, 137, 19\u201335.","journal-title":"Mathematical Programming A"},{"key":"2024_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., & Saxena, A. (2008). Optimizing over the split closure. Mathematical Programming A, 113, 219\u2013240.","journal-title":"Mathematical Programming A"},{"key":"2024_CR13","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. (2011). On the relative strength of split, triangle and quadrilateral cuts. Mathematical Programming A, 126, 281\u2013314.","journal-title":"Mathematical Programming A"},{"key":"2024_CR14","doi-asserted-by":"crossref","unstructured":"Basu, A., Campelo, M., Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010). On lifting integer variables in minimal inequalities. In Proceedings of IPCO, lecture notes in computer science (vol. 6080, pp. 85\u201395).","DOI":"10.1007\/978-3-642-13036-6_7"},{"key":"2024_CR15","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10107-012-0560-9","volume":"141","author":"A Basu","year":"2013","unstructured":"Basu, A., Campelo, M., Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2013). Unique lifting of integer variables in minimal inequalities. Mathematical Programming A, 141, 561\u2013576.","journal-title":"Mathematical Programming A"},{"key":"2024_CR16","doi-asserted-by":"crossref","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010a). Maximal lattice-free convex sets in linear subspaces. Mathematics of Operations Research, 35, 704\u2013720.","DOI":"10.1287\/moor.1100.0461"},{"key":"2024_CR17","doi-asserted-by":"crossref","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010b). Minimal inequalities for an infinite relaxation of integer programs. SIAM Journal on Discrete Optimization, 24, 158\u2013168.","DOI":"10.1137\/090756375"},{"key":"2024_CR18","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., & K\u00f6ppe, M. (2012a). Unique minimal liftings for simplicial polytopes. Mathematics of Operations Research, 37(2), 346\u2013355.","DOI":"10.1287\/moor.1110.0536"},{"key":"2024_CR19","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., & Margot, F. (2012b). Intersection cuts with infinite split rank. Mathematics of Operations Research, 37(1), 21\u201340.","DOI":"10.1287\/moor.1110.0522"},{"key":"2024_CR20","doi-asserted-by":"crossref","unstructured":"Basu, A., Cornu\u00e9jols, G., & Molinaro, M. (2011a). A probabilistic analysis of the strength of the split and triangle closures. In Proceedings of IPCO, lecture notes in computer science (vol .6655, pp. 27\u201338).","DOI":"10.1007\/978-3-642-20807-2_3"},{"key":"2024_CR21","unstructured":"Basu, A., Cornu\u00e9jols, G., & Zambelli, G. (2011b). Convex sets and minimal sublinear functions. Journal of Convex Analysis, 18(2), 427\u2013432."},{"key":"2024_CR22","unstructured":"Basu, A., Hildebrand, R., & K\u00f6ppe, M. (2011). Algorithmic and complexity results for cutting planes derived from maximal lattice-free convex sets. Manuscript."},{"key":"2024_CR23","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/sapm1977562187","volume":"56","author":"DE Bell","year":"1977","unstructured":"Bell, D. E. (1977). A theorem concerning the integer lattice. Studies in Applied Mathematics, 56, 187\u2013188.","journal-title":"Studies in Applied Mathematics"},{"issue":"1&2","key":"2024_CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S1471068404002261","volume":"5","author":"F Benoy","year":"2005","unstructured":"Benoy, F., King, A., & Mesnard, F. (2005). Computing convex hulls with a linear solver. Theory and Practice of Logic Programming, 5(1&2), 259\u2013271.","journal-title":"Theory and Practice of Logic Programming"},{"key":"2024_CR25","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A Caprara","year":"2003","unstructured":"Caprara, A., & Letchford, A. N. (2003). On the separation of split cuts and related inequalities. Mathematical Programming B, 94, 279\u2013294.","journal-title":"Mathematical Programming B"},{"key":"2024_CR26","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. (1973). Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4, 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"2024_CR27","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010a). Eqivalence between intersection cuts and the corner polyhedron. Operations Research Letters, 38, 153\u2013155.","DOI":"10.1016\/j.orl.2010.02.006"},{"key":"2024_CR28","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2010b). Polyhedral approaches to mixed integer linear programming. In M. Juenger, T. Liebling, D. Naddef, W. Pulleyblank, G. Reinelt, G. Rinaldi, & L. Wolsey (Eds.), 50 years of integer programming 1958\u20132008: From the early years to the state-of-the-art (pp. 334\u2013384). Berlin: Springer.","DOI":"10.1007\/978-3-540-68279-0_11"},{"key":"2024_CR29","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2011a). Corner polyhedron and intersection cuts. Surveys in Operations Research and Management Science, 16, 105\u2013120.","DOI":"10.1016\/j.sorms.2011.03.001"},{"key":"2024_CR30","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2011b). A geometric perspective on lifting. Operations Research, 59, 569\u2013577.","DOI":"10.1287\/opre.1110.0916"},{"key":"2024_CR31","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-013-0634-3","volume":"144","author":"M Conforti","year":"2014","unstructured":"Conforti, M., & Del Pia, A. (2014). Disjunctive programming and relaxations of polyhedra. Mathematical Programming A, 144, 307\u2013314.","journal-title":"Mathematical Programming A"},{"key":"2024_CR32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W. J., Kannan, R., & Schrijver, A. (1990). Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming, 47, 155\u2013174.","journal-title":"Mathematical Programming"},{"key":"2024_CR33","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. (2002). On the rank of mixed 0, 1 polyhedra. Mathematical Programming A, 91, 391\u2013397.","journal-title":"Mathematical Programming A"},{"key":"2024_CR34","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.orl.2009.10.010","volume":"38","author":"S Dash","year":"2010","unstructured":"Dash, S. (2010). On the complexity of cutting-plane proofs using split cuts. Operations Research Letters, 38, 109\u2013114.","journal-title":"Operations Research Letters"},{"key":"2024_CR35","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. (2011). On mixed-integer sets with two integer variables. Operations Research Letters, 39, 305\u2013309.","journal-title":"Operations Research Letters"},{"key":"2024_CR36","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. (2012). Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Mathematical Programming A, 135, 221\u2013254.","journal-title":"Mathematical Programming A"},{"key":"2024_CR37","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-013-0654-z","volume":"145","author":"S Dash","year":"2014","unstructured":"Dash, S., Dobbs, N., G\u00fcnl\u00fck, O., Nowicki, T., & Swirszcz, G. (2014). Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. Mathematical Programming A, 145, 483\u2013508.","journal-title":"Mathematical Programming A"},{"key":"2024_CR38","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O., & Lodi, A. (2007). On the MIR closure of polyhedra. In Proceedings of IPCO, lecture notes in computer science (vol. 4513, pp. 337\u2013351).","DOI":"10.1007\/978-3-540-72792-7_26"},{"key":"2024_CR39","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-008-0225-x","volume":"121","author":"S Dash","year":"2010","unstructured":"Dash, S., G\u00fcnl\u00fck, O., & Lodi, A. (2010). MIR closures of polyhedral sets. Mathematical Programming A, 121, 33\u201360.","journal-title":"Mathematical Programming A"},{"key":"2024_CR40","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.orl.2011.02.011","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash, S., G\u00fcnl\u00fck, O., & Raack, C. (2011). A note on the MIR closure and basic relaxations of polyhedra. Operations Research Letters, 39, 198\u2013199.","journal-title":"Operations Research Letters"},{"key":"2024_CR41","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. (2014). Computational experiments with cross and crooked cross cuts. INFORMS Journal on Computing, 26, 780\u2013797.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2024_CR42","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1287\/moor.1110.0527","volume":"37","author":"A Pia Del","year":"2012","unstructured":"Del Pia, A. (2012). On the rank of disjunctive cuts. Mathematics of Operations Research, 37(2), 372\u2013378.","journal-title":"Mathematics of Operations Research"},{"key":"2024_CR43","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.orl.2011.04.005","volume":"39","author":"A Pia Del","year":"2011","unstructured":"Del Pia, A., Wagner, C., & Weismantel, R. (2011). A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts. Operations Research Letters, 39, 234\u2013240.","journal-title":"Operations Research Letters"},{"key":"2024_CR44","doi-asserted-by":"crossref","unstructured":"Del Pia, A., & Weismantel, R. (2012a). On convergence in mixed integer programming. Mathematical Programming A, 135, 397\u2013412.","DOI":"10.1007\/s10107-011-0476-9"},{"key":"2024_CR45","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., & Weismantel, R. (2012b). Relaxations of mixed integer sets from lattice-free polyhedra. 4OR, 10(3), 221\u2013244.","DOI":"10.1007\/s10288-012-0198-8"},{"key":"2024_CR46","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. (2011). A note on the split rank of intersection cuts. Mathematical Programming A, 130, 107\u2013124.","journal-title":"Mathematical Programming A"},{"key":"2024_CR47","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. (2011). Split rank of triangle and quadrilateral inequalities. Mathematics of Operations Research, 36, 432\u2013461.","journal-title":"Mathematics of Operations Research"},{"key":"2024_CR48","doi-asserted-by":"crossref","unstructured":"Dey, S. S., & Wolsey, L. A. (2008). Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In Proceedings of IPCO, lecture notes in computer science (vol. 5035, pp. 463\u2013475).","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"2024_CR49","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey, S. S., & Wolsey, L. A. (2010). Two row mixed-integer cuts via lifting. Mathematical Programming B, 124, 143\u2013174.","journal-title":"Mathematical Programming B"},{"key":"2024_CR50","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.disopt.2010.09.002","volume":"8","author":"R Fukasawa","year":"2011","unstructured":"Fukasawa, R., & G\u00fcnl\u00fck, O. (2011). Strengthening lattice-free cuts using non-negativity. Discrete Optimization, 8, 229\u2013245.","journal-title":"Discrete Optimization"},{"key":"2024_CR51","first-page":"335","volume":"69","author":"MX Goemans","year":"1995","unstructured":"Goemans, M. X. (1995). Worst-case comparison of valid inequalities for the TSP. Mathematical Programming, 69, 335\u2013349.","journal-title":"Mathematical Programming"},{"key":"2024_CR52","first-page":"269","volume-title":"Recent advances in mathematical programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R. E. (1963). An algorithm for integer solutions to linear programs. In R. L. Graves & P. Wolfe (Eds.), Recent advances in mathematical programming (pp. 269\u2013302). New York: McGraw-Hill."},{"key":"2024_CR53","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"RE Gomory","year":"1965","unstructured":"Gomory, R. E. (1965). On the relation between integer and non-integer solutions to linear programs. Proceedings of the National Academy of Sciences, 53, 260\u2013265.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2024_CR54","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R. E. (1969). Some polyhedra related to combinatorial problems. Linear Algebra and its Applications, 2, 451\u2013558.","journal-title":"Linear Algebra and its Applications"},{"key":"2024_CR55","unstructured":"J\u00f6rg, M. (2008). $$k$$ k -disjunctive cuts and cutting plane algorithms for general mixed integer linear programs. PhD thesis, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen."},{"key":"2024_CR56","unstructured":"Khachiyan, L. G. (1979). A polynomial algorithm in linear programming (in Russian). Doklady Akademii Nauk SSSR, 244:1093\u20131096. (English translation: Soviet Mathematics Doklady, 20:191\u2013194, 1979)."},{"key":"2024_CR57","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan, L. G. (1980). Polynomial algorithms in linear programming (in russian). Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki, 20:51\u201368, 1980. (English translation). U.S.S.R. Computational Mathematics and Mathematical Physics, 20, 53\u201372.","journal-title":"U.S.S.R. Computational Mathematics and Mathematical Physics"},{"key":"2024_CR58","first-page":"177","volume-title":"Mathematical programming: Recent developments and applications","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L. (1989). Geometry of numbers and integer programming. In M. Iri & K. Tanabe (Eds.), Mathematical programming: Recent developments and applications (pp. 177\u2013201). Dordrecht: Kluwer."},{"key":"2024_CR59","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., & Wolsey, L. A. (2001). Aggregation and mixed integer rounding to solve MIPs. Operations Research, 49, 363\u2013371.","journal-title":"Operations Research"},{"key":"2024_CR60","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R. R. (1974). On the existence of optimal solutions to integer and mixed-integer programming problems. Mathematical Programming, 7, 223\u2013235.","journal-title":"Mathematical Programming"},{"key":"2024_CR61","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/100796947","volume":"25","author":"R Mor\u00e1n","year":"2011","unstructured":"Mor\u00e1n, R., & Dey, S. S. (2011). On maximal $$S$$ S -free convex sets. SIAM Journal on Discrete Mathematics, 25, 379\u2013393.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2024_CR62","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. (1990). A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Mathematical Programming, 46, 379\u2013390.","journal-title":"Mathematical Programming"},{"key":"2024_CR63","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1110.0503","volume":"36","author":"B Nill","year":"2011","unstructured":"Nill, B., & Ziegler, G. M. (2011). Projecting lattice polytopes without interior lattice points. Mathematics of Operations Research, 36, 462\u2013467.","journal-title":"Mathematics of Operations Research"},{"key":"2024_CR64","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"JH Owen","year":"2001","unstructured":"Owen, J. H., & Mehrotra, S. (2001). A disjunctive cutting plane procedure for general mixed integer linear programs. Mathematical Programming A, 89, 437\u2013448.","journal-title":"Mathematical Programming A"},{"key":"2024_CR65","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton: Princeton University Press."},{"key":"2024_CR66","first-page":"18","volume":"21","author":"G Salinetti","year":"1979","unstructured":"Salinetti, G., & Wets, R. J.-B. (1979). On the convergence of sequences of convex sets in finite dimensions. Society for Industrial and Applied Mathematics, 21, 18\u201333.","journal-title":"Society for Industrial and Applied Mathematics"},{"key":"2024_CR67","doi-asserted-by":"crossref","first-page":"3637","DOI":"10.1073\/pnas.74.9.3637","volume":"74","author":"HE Scarf","year":"1977","unstructured":"Scarf, H. E. (1977). An observation on the structure of production sets with indivisiblities. Proceedings of the National Academy of Sciences USA, 74, 3637\u20133641.","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"2024_CR68","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A Schrijver","year":"1980","unstructured":"Schrijver, A. (1980). On cutting planes. Annals of Discrete Mathematics, 9, 291\u2013296.","journal-title":"Annals of Discrete Mathematics"},{"key":"2024_CR69","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A. (1986). Theory of linear and integer programming. Chichester: Wiley."},{"key":"2024_CR70","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"JP Vielma","year":"2007","unstructured":"Vielma, J. P. (2007). A constructive characterization of the split closure of a mixed integer linear program. Operations Research Letters, 35, 29\u201335.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2024-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2024-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2024-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T18:25:29Z","timestamp":1567189529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2024-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,18]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["2024"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2024-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,18]]}}}