{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:35:27Z","timestamp":1732034127818},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s12532-012-0037-0","type":"journal-article","created":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T10:37:18Z","timestamp":1331807838000},"page":"151-179","source":"Crossref","is-referenced-by-count":28,"title":["On optimizing over lift-and-project closures"],"prefix":"10.1007","volume":"4","author":[{"given":"Pierre","family":"Bonami","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,16]]},"reference":[{"issue":"11","key":"37_CR1","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1287\/mnsc.1050.0382","volume":"50","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. Manag. Sci. 50(11), 1720\u20131732 (2005)","journal-title":"Manag. Sci."},{"key":"37_CR2","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. Progr. 102, 457\u2013493 (2005)","journal-title":"Math. Progr."},{"key":"37_CR3","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\u2014a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"issue":"3","key":"37_CR4","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discret. Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discret. Appl. Math. 89, 3\u201344 (1998) (originally MSRR # 348, Carnegie Mellon University, July 1974)","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-009-0006-4","volume":"1","author":"E. Balas","year":"2009","unstructured":"Balas E., Bonami P.: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Math. Progr. Comput. 1, 165\u2013199 (2009)","journal-title":"Math. Progr. Comput."},{"key":"37_CR7","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 0-1 programs. Math. Progr. 58, 295\u2013324 (1993)","journal-title":"Math. Progr."},{"key":"37_CR8","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-1 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42, 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"issue":"4","key":"37_CR9","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.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4), 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR10","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-1 programming: recent progress. Discret. Appl. Math. 123, 129\u2013154 (2002)","journal-title":"Discret. Appl. Math."},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas E., Perregaard M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Progr. 94, 221\u2013245 (2003)","journal-title":"Math. Progr."},{"key":"37_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.: Optimizing over the split closure. Math. Progr. 113, 219\u2013240 (2008)","journal-title":"Math. Progr."},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas E., Zemel E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34, 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"37_CR14","unstructured":"Bixby, R., Ceria, S., McZeal, C., Savelsbergh, M.: Miplib 3.0. http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html (1998)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: The Sharpest cut, chapter mixed-integer programming: a progress report, pp. 309\u2013326. MPS-SIAM Series on Optimization. SIAM (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"37_CR16","unstructured":"Bonami, P., Balas, E.: Cgllandp. https:\/\/projects.coin-or.org\/cgl\/wiki\/cgllandp . July (2006)"},{"issue":"2","key":"37_CR17","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., Lodi A.: Projected Chv\u00e1tal\u2013Gomory cuts for mixed integer linear programs. Math. Progr. Series A 113(2), 241\u2013257 (2008)","journal-title":"Math. Progr. Series A"},{"issue":"4","key":"37_CR18","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. Discret. Optim. 2(4), 288\u2013307 (2005)","journal-title":"Discret. Optim."},{"issue":"2\u20133","key":"37_CR19","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.: On the separation of split cuts and related inequalities. Math. Progr. 94(2\u20133), 279\u2013294 (2003)","journal-title":"Math. Progr."},{"key":"37_CR20","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 optimization. Discret. Math. 4, 305\u2013337 (1973)","journal-title":"Discret. Math."},{"key":"37_CR21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R., Schrijver A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Progr. 47, 155\u2013174 (1990)","journal-title":"Math. Progr."},{"key":"37_CR22","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., Li Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Nannicini, G. Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Progr. Comput. pp. 1\u201338. doi: 10.1007\/s12532-011-0028-6","DOI":"10.1007\/s12532-011-0028-6"},{"key":"37_CR24","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. Progr. Comput. 2, 231\u2013257 (2010)","journal-title":"Math. Progr. Comput."},{"issue":"1","key":"37_CR25","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.: MIR closures of polyhedral sets. Math. Progr. 121(1), 33\u201360 (2010)","journal-title":"Math. Progr."},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19(2), (1999)","DOI":"10.1007\/s004930050057"},{"key":"37_CR27","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. Progr. 110, 3\u201320 (2007). doi: 10.1007\/s10107-006-0054-8","journal-title":"Math. Progr."},{"key":"37_CR28","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10107-009-0300-y","volume":"128","author":"M. Fischetti","year":"2011","unstructured":"Fischetti M., Lodi A., Tramontani A.: On the separation of disjunctive cuts. Math. Progr. 128, 205\u2013230 (2011)","journal-title":"Math. Progr."},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Salvagnin, D.: An in-out approach to disjunctive optimization. In: Lodi, A., Milano, M., Toth, P., (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 6140, pp. 136\u2013140. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13520-0_17"},{"key":"37_CR30","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\u2019s mixed-integer cuts. Math. Progr. Comput. 3, 79\u2013102 (2011)","journal-title":"Math. Progr. Comput."},{"key":"37_CR31","unstructured":"Forrest, J.: CLP. http:\/\/www.coin-or.org\/ (2004)"},{"key":"37_CR32","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R. Gomory","year":"1963","unstructured":"Gomory R.: An algorithm for integer solution solutions to linear programming. In: Graves, R.L., Wolfe, P. (eds) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman R., Hall, M. (eds.) Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics, vol. 10, pp. 211\u2013216. Providence (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"issue":"4","key":"37_CR34","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley J.E.: The cutting plane method for solving convex programs. J. SIAM 8(4), 703\u2013712 (1960)","journal-title":"J. SIAM"},{"key":"37_CR35","unstructured":"Lougee-Heimer, R.: The common optimization interface for operations research. IBM J. Res. Dev. 47, 57\u201366 (2003). http:\/\/www.coin-or.org"},{"key":"37_CR36","unstructured":"Martin, A., Achterberg, T., Koch, T.: MIPLIB 2003. http:\/\/miplib.zib.de (2003)"},{"key":"37_CR37","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. Nemhauser","year":"1990","unstructured":"Nemhauser G., Wolsey L.: A recursive procedure to generate all cuts for 0-1 mixed integer programs. Math. Progr. 46, 379\u2013390 (1990)","journal-title":"Math. Progr."},{"key":"37_CR38","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M. Padberg","year":"1985","unstructured":"Padberg M., Roy T., Wolsey L.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"37_CR39","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.V. Roy","year":"1987","unstructured":"Roy T.V., Wolsey L.: Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35, 45\u201357 (1987)","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0037-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0037-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0037-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T09:03:14Z","timestamp":1561453394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0037-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0037-0","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}