{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:26:12Z","timestamp":1725557172401},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_5","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"57-70","source":"Crossref","is-referenced-by-count":4,"title":["Zero-Coefficient Cuts"],"prefix":"10.1007","author":[{"given":"Kent","family":"Andersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_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.: MIPLIB 2003. Operations Research Letters\u00a034, 361\u2013372 (2006)","journal-title":"Operations Research Letters"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.orl.2008.08.003","volume":"36","author":"K. Andersen","year":"2008","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: Certificates of linear mixed integer infeasibility. Operations Research Letters\u00a036, 734\u2013738 (2008)","journal-title":"Operations Research Letters"},{"key":"5_CR3","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.A.: Inequalities 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":"5_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas, E.: Intersection Cuts - a new type of cutting planes for integer programming. Operations Research\u00a019, 19\u201339 (1971)","journal-title":"Operations Research"},{"key":"5_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. Mathematical Programming, Ser. A\u00a0113, 219\u2013240 (2008)","journal-title":"Mathematical Programming, Ser. A"},{"key":"5_CR6","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":"0. Optima"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Letchford, A.: On the separation of split cuts and related inequalities. Mathematical Programming, Ser. A\u00a094, 279\u2013294 (2003)","journal-title":"Mathematical Programming, Ser. A"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W.J. Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming\u00a047, 155\u2013174 (1990)","journal-title":"Mathematical Programming"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"429","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. Mathematical Programming, Ser. A\u00a0120, 429\u2013456 (2009)","journal-title":"Mathematical Programming, Ser. A"},{"key":"5_CR10","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960a)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. Nemhauser","year":"1990","unstructured":"Nemhauser, G., Wolsey, L.A.: A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming, Ser. A\u00a046, 379\u2013390 (1990)","journal-title":"Mathematical Programming, Ser. A"}],"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-642-13036-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:00Z","timestamp":1619783520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}