{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:23Z","timestamp":1725793823395},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_15","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"174-185","source":"Crossref","is-referenced-by-count":8,"title":["Cut Generation through Binarization"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bonami","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Margot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett.\u00a034, 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72792-7_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Andersen","year":"2007","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Cutting planes from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"15_CR3","doi-asserted-by":"publisher","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. Program.\u00a058, 295\u2013323 (1993)","journal-title":"Math. Program."},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","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. European J. Oper. Res.\u00a04(4), 224\u2013234 (1980)","journal-title":"European J. Oper. Res."},{"key":"15_CR5","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. Math. Program.\u00a0113, 219\u2013240 (2008)","journal-title":"Math. Program."},{"key":"15_CR6","doi-asserted-by":"publisher","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. Computation\u00a04, 151\u2013179 (2012)","journal-title":"Math. Program. Computation"},{"key":"15_CR7","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)","journal-title":"Optima"},{"key":"15_CR8","doi-asserted-by":"publisher","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.\u00a059, 202\u2013210 (2011)","journal-title":"Oper. Res."},{"key":"15_CR9","doi-asserted-by":"publisher","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. Program.\u00a047, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-008-0221-1","volume":"120","author":"G. Cornu\u00e9jols","year":"2009","unstructured":"Cornu\u00e9jols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Math. Program.\u00a0120, 419\u2013456 (2009)","journal-title":"Math. Program."},{"key":"15_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. Math. Program.\u00a0121, 33\u201360 (2010)","journal-title":"Math. Program."},{"key":"15_CR12","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Molinaro, M.: On the relative strength of different generalizations of split cuts. Working paper (2012)"},{"key":"15_CR13","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. Working paper (2011)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1287\/ijoc.1120.0543","volume":"25","author":"M. Fischetti","year":"2013","unstructured":"Fischetti, M., Salvagnin, D.: Approximating the split closure. INFORMS Journal on Computing\u00a025, 808\u2013819 (2013)","journal-title":"INFORMS Journal on Computing"},{"key":"15_CR15","unstructured":"Fischetti, M., Salvagnin, D.: Personnal communication"},{"key":"15_CR16","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E.: An Algorithm for Integer Solutions to Linear Programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"15_CR17","doi-asserted-by":"publisher","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.\u00a05, 724\u2013734 (2008)","journal-title":"Discrete Optim."},{"key":"15_CR18","unstructured":"Louveaux, Q., Poirrier, L., Salvagnin, D.: The strength of multi-row models. Working paper (2012)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1287\/opre.50.5.810.370","volume":"50","author":"H. Owen","year":"2002","unstructured":"Owen, H., Mehrotra, S.: On the value of binary expansions for general mixed-integer linear programs. Oper. Res.\u00a050, 810\u2013819 (2002)","journal-title":"Oper. Res."},{"key":"15_CR20","unstructured":"Roy, J.-S.: \u201cBinarize and Project\u201d to generate cuts for general mixed-integer programs. Algorithmic Oper. Res.\u00a02 (2007)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:08:23Z","timestamp":1558904903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}