{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:46Z","timestamp":1761620986823},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10107-008-0225-x","type":"journal-article","created":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T12:54:11Z","timestamp":1210942451000},"page":"33-60","source":"Crossref","is-referenced-by-count":46,"title":["MIR closures of polyhedral sets"],"prefix":"10.1007","volume":"121","author":[{"given":"Sanjeeb","family":"Dash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"225_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., Cornuejols G. and Li Y. (2005). Split closure and intersection cuts. Math. Program. Ser. A 102: 457\u2013493","journal-title":"Math. Program. Ser. A"},{"key":"225_CR2","first-page":"89","volume-title":"Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4513","author":"E. Balas","year":"2007","unstructured":"Balas E. and Bonami P. (2007). New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. In: Fischetti, M. and Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4513, pp 89\u2013103. Springer, Berlin"},{"key":"225_CR3","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. Ann. Discret. Math. 5: 3\u201351","journal-title":"Ann. Discret. Math."},{"key":"225_CR4","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. and Cornu\u00e9jols G. (1996). Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42: 1229\u20131246","journal-title":"Manag. Sci."},{"key":"225_CR5","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. and Natraj G. (1996). Gomory cuts revisited. Operat. Res. Lett. 19: 1\u20139","journal-title":"Operat. Res. Lett."},{"key":"225_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas E. and Perregaard M. (2003). A precise correspondence between lift-and-project cuts, simple disjunctive cuts and mixed integer Gomory cuts for 0-1 programming. Math. Program. Ser. B 94: 221\u2013245","journal-title":"Math. Program. Ser. B"},{"key":"225_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E. Balas","year":"2008","unstructured":"Balas E. and Saxena A. (2008). Optimizing over the split closure. Math. Program. Ser. A 113: 219\u2013240","journal-title":"Math. Program. Ser. A"},{"key":"225_CR8","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0"},{"key":"225_CR9","unstructured":"CglLandP: https:\/\/projects.coin-or.org\/Cgl\/wiki\/CglLandP"},{"key":"225_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.orl.2007.03.011","volume":"36","author":"P. Bonami","year":"2008","unstructured":"Bonami P. and Cornu\u00e9jols G. (2008). A note on the MIR closure. Operat. Res. Lett. 36: 4\u20136","journal-title":"Operat. Res. Lett."},{"key":"225_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-006-0051-y","volume":"113","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Cornu\u00e9jols G., Dash S., Fischetti M. and Lodi A. (2008). Projected Chv\u00e1tal-Gomory cuts for mixed integer linear programs. Math. Program. Ser. A 113: 241\u2013257","journal-title":"Math. Program. Ser. A"},{"key":"225_CR12","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. and Minoux M. (2005). Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discret. Optim. 2: 288\u2013307","journal-title":"Discret. Optim."},{"key":"225_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara A. and Letchford A. (2003). On the separation of split cuts and related inequalities. Math. Program. Ser. B 94: 279\u2013294","journal-title":"Math. Program. Ser. B"},{"key":"225_CR14","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. Discret. Math. 4: 305\u2013337","journal-title":"Discret. Math."},{"key":"225_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W.J. Cook","year":"1990","unstructured":"Cook W.J., Kannan R. and Schrijver A. (1990). Chv\u00e1tal closures for mixed integer programming problems. Math. Program. Ser. A 47: 155\u2013174","journal-title":"Math. Program. Ser. A"},{"key":"225_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G. Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols G. (2008). Valid Inequalities for Mixed Integer Linear Programs. Math. Program. Ser. B 112: 3\u201344","journal-title":"Math. Program. Ser. B"},{"key":"225_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G. and Li Y. (2001). Elementary closures for integer programs. Operat. Res. Lett. 28: 1\u20138","journal-title":"Operat. Res. Lett."},{"key":"225_CR18","first-page":"391","volume":"91","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G. and Li Y. (2001). On the Rank of Mixed 0,1 Polyhedra. Math. Program. Ser. A 91: 391\u2013397","journal-title":"Math. Program. Ser. A"},{"key":"225_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna E., Rothberg E. and Le Paper C. (2005). Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. Ser. A 102: 71\u201390","journal-title":"Math. Program. Ser. A"},{"key":"225_CR20","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Goycoolea, M.: Two step MIR inequalities for mixed-integer programs. IBM Research Report 23791 (2005)"},{"key":"225_CR21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand F. (1999). On the membership problem for the elementary closure of a polyhedron. Combinatorica 19: 297\u2013300","journal-title":"Combinatorica"},{"key":"225_CR22","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem, RM-2597, The Rand Corporation (1960)"},{"key":"225_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti M. and Lodi A. (2007). Optimizing over the first Chv\u00e1tal closure. Math. Program. Ser. B 110: 3\u201320","journal-title":"Math. Program. Ser. B"},{"key":"225_CR24","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. and Wolsey L.A. (2001). Aggregation and Mixed Integer Rounding to solve MIPs. Operat. Res. 49: 363\u2013371","journal-title":"Operat. Res."},{"key":"225_CR25","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. Nemhauser","year":"1990","unstructured":"Nemhauser G. and Wolsey L.A. (1990). A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Program. Ser. A 46: 379\u2013390","journal-title":"Math. Program. Ser. A"},{"key":"225_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser G. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. Wiley, New York"},{"key":"225_CR27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"J.P. Vielma","year":"2007","unstructured":"Vielma J.P. (2007). A Constructive Characterization of the Split Closure of a Mixed Integer Linear Program. Operat. Res. Lett. 35: 29\u201335","journal-title":"Operat. Res. Lett."},{"key":"225_CR28","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A. (1998). Integer Programming. Wiley, New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0225-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0225-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0225-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:05Z","timestamp":1559123405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0225-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0225-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,17]]}}}