{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:40:12Z","timestamp":1725558012127},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_16","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"123-135","source":"Crossref","is-referenced-by-count":2,"title":["A Relax-and-Cut Framework for Gomory\u2019s Mixed-Integer Cuts"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"16_CR1","doi-asserted-by":"publisher","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. Mathematical Programming Computation\u00a01(2-3), 165\u2013199 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Dash, S., Goycoolea, M.: A heuristic to generate rank-1 GMI cuts. Technical report, IBM (2009)","DOI":"10.1007\/s12532-010-0018-0"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G. Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols, G.: Valid inequalities for mixed integer linear programs. Mathematical Programming\u00a0112(1), 3\u201344 (2008)","journal-title":"Mathematical Programming"},{"key":"16_CR4","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation (1960)"},{"key":"16_CR5","doi-asserted-by":"publisher","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. Operations Research Letters\u00a019, 1\u20139 (1996)","journal-title":"Operations Research Letters"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10479-006-0100-1","volume":"149","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G.: Revival of the Gomory cuts in the 1990\u2019s. Annals of Operations Research\u00a0149(1), 63\u201366 (2006)","journal-title":"Annals of Operations Research"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Mathematical Programming (2009)","DOI":"10.1007\/s10107-009-0335-0"},{"issue":"2-3","key":"16_CR8","doi-asserted-by":"publisher","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. Mathematical Programming\u00a094(2-3), 221\u2013245 (2003)","journal-title":"Mathematical Programming"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e0tal closure. Mathematical Programming\u00a0110(1), 3\u201320 (2007)","journal-title":"Mathematical Programming"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0113(2), 219\u2013240 (2008)","journal-title":"Mathematical Programming"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0121(1), 33\u201360 (2010)","journal-title":"Mathematical Programming"},{"key":"16_CR12","first-page":"2","volume":"21","author":"A. Lucena","year":"1982","unstructured":"Lucena, A.: Steiner problems in graphs: Lagrangian optimization and cutting planes. COAL Bulletin\u00a0(21), 2\u20138 (1982)","journal-title":"COAL Bulletin"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02085641","volume":"50","author":"L.F. Escudero","year":"1994","unstructured":"Escudero, L.F., Guignard, M., Malik, K.: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. Annals of Operations Research\u00a050(1), 219\u2013237 (1994)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10479-005-3977-1","volume":"140","author":"A. Lucena","year":"2005","unstructured":"Lucena, A.: Non delayed relax-and-cut algorithms. Annals of Operations Research\u00a0140(1), 375\u2013410 (2005)","journal-title":"Annals of Operations Research"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-0-387-30165-5_5","volume-title":"Handbook of Optimization in Telecommunications","author":"A. Lucena","year":"2006","unstructured":"Lucena, A.: Lagrangian relax-and-cut algorithms. In: Handbook of Optimization in Telecommunications, pp. 129\u2013145. Springer, Heidelberg (2006)"},{"key":"16_CR16","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.B. Hiriart-Hurruty","year":"1993","unstructured":"Hiriart-Hurruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Heidelberg (1993)"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for set covering problem. Operations Research\u00a047(5), 730\u2013743 (1999)","journal-title":"Operations Research"},{"key":"16_CR18","unstructured":"Guta, B.: Subgradient Optimization Methods in Integer Programming with an Application to a Radiation Therapy Problem. PhD thesis, University of Kaiserslautern (2003)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding cuts in a branch and cut framework: a computational study with {0,1\/2}-cuts. INFORMS Journal on Computing\u00a0(19), 229\u2013238 (2007)","DOI":"10.1287\/ijoc.1050.0162"},{"issue":"2-3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T.K. Ralphs","year":"2003","unstructured":"Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Mathematical Programming\u00a094(2-3), 343\u2013359 (2003)","journal-title":"Mathematical Programming"},{"key":"16_CR21","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima\u00a058, 12\u201315 (1998), http:\/\/www.caam.rice.edu\/bixby\/miplib\/miplib.html","journal-title":"Optima"},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters\u00a034(4), 1\u201312 (2006), http:\/\/miplib.zib.de","journal-title":"Operations Research Letters"},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","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. Operations Research Letters\u00a028(1), 1\u20138 (2001)","journal-title":"Operations Research Letters"},{"key":"16_CR24","unstructured":"CglLandP: website, https:\/\/projects.coin-or.org\/Cgl\/wiki\/CglLandP"},{"key":"16_CR25","unstructured":"COIN-OR: website, http:\/\/www.coin-or.org\/"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:12Z","timestamp":1606185552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}