{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:06Z","timestamp":1725479826062},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_13","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T10:08:39Z","timestamp":1362996519000},"page":"145-156","source":"Crossref","is-referenced-by-count":0,"title":["On Some Generalizations of the Split Closure"],"prefix":"10.1007","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":"Diego Alejandro Mor\u00e1n","family":"Ramirez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0102(3), 457\u2013493 (2005)","journal-title":"Mathematical Programming"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K. Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed integer linear sets based on lattice point free convex sets. Math. Oper. Res.\u00a035(1), 233\u2013256 (2010)","journal-title":"Math. Oper. Res."},{"key":"13_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)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.disopt.2012.06.003","volume":"9","author":"G. Averkov","year":"2012","unstructured":"Averkov, G.: On finitely generated closures in the theory of cutting planes. Discrete Optimization\u00a09(1), 209\u2013215 (2012)","journal-title":"Discrete Optimization"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G. Averkov","year":"2011","unstructured":"Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Mathematics of Operations Research\u00a036(4), 721\u2013742 (2011)","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"13_CR6","first-page":"990","volume":"2","author":"T. Bang","year":"1951","unstructured":"Bang, T.: A solution of the plank problem. Proc. American Mathematical Society\u00a02(6), 990\u2013993 (1951)","journal-title":"Proc. American Mathematical Society"},{"key":"13_CR7","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: The triangle closure is a polyhedron (2011) (manuscript)"},{"key":"13_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. Math. Program.\u00a047, 155\u2013174 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.orl.2011.02.002","volume":"39","author":"D. Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The split closure of a strictly convex body. Oper. Res. Lett.\u00a039(2), 121\u2013126 (2011)","journal-title":"Oper. Res. Lett."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-011-0455-1","volume":"135","author":"S. Dash","year":"2012","unstructured":"Dash, S., Dey, S., G\u00fcnl\u00fck, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program.\u00a0135, 221\u2013254 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"13_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(1), 33\u201360 (2010)","journal-title":"Math. Program."},{"key":"13_CR12","unstructured":"Dey, S.S.: Personal Communication (2010)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BF01899998","volume":"8","author":"V.L. Klee","year":"1957","unstructured":"Klee, V.L.: Extremal structure of convex sets. Archiv der Mathematik\u00a08, 234\u2013240 (1957)","journal-title":"Archiv der Mathematik"},{"key":"13_CR14","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 Optimization\u00a05, 724\u2013734 (2008)","journal-title":"Discrete Optimization"},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"G.T. Rockafeller","year":"1970","unstructured":"Rockafeller, G.T.: Convex analysis. Princeton University Press, New Jersey (1970)"},{"key":"13_CR16","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley and Sons, New York (1986)"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"J.P. Vielma","year":"2007","unstructured":"Vielma, J.P.: A constructive characterization of the split closure of a mixed integer linear program. Oper. Res. Lett.\u00a035(1), 29\u201335 (2007)","journal-title":"Oper. Res. Lett."}],"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-36694-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T17:50:05Z","timestamp":1557597005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}