{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T13:13:35Z","timestamp":1721826815633},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12532-020-00180-9","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T06:12:50Z","timestamp":1583302370000},"page":"295-335","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Split cuts from sparse disjunctions"],"prefix":"10.1007","volume":"12","author":[{"given":"Ricardo","family":"Fukasawa","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Poirrier","sequence":"additional","affiliation":[]},{"given":"Shenghao","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"issue":"4","key":"180_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. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009","journal-title":"Oper. Res. Lett."},{"key":"180_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-13036-6_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Weismantel, R.: Zero-coefficient cuts. In: Eisenbrand, F., Shepherd, F.B. (eds.) Integer Programming and Combinatorial Optimization, pp. 57\u201370. Springer, Berlin (2010)"},{"issue":"6","key":"180_CR3","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., \u00c7ataly\u00fcrek, U.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput. 25(6), 1860\u20131879 (2004). https:\/\/doi.org\/10.1137\/S1064827502401953","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20133","key":"180_CR4","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\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"9","key":"180_CR5","doi-asserted-by":"publisher","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\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42(9), 1229\u20131246 (1996). https:\/\/doi.org\/10.1287\/mnsc.42.9.1229","journal-title":"Manag. Sci."},{"issue":"2","key":"180_CR6","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. 113(2), 219\u2013240 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0049-5","journal-title":"Math. Program."},{"key":"180_CR7","doi-asserted-by":"publisher","unstructured":"Bastubbe, M., L\u00fcbbecke, M.E., Witt, J.T.: A computational investigation on the strength of Dantzig\u2013Wolfe reformulations. In: D\u2019Angelo, G. (ed.) 17th International Symposium on Experimental Algorithms (SEA 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 103, pp. 11:1\u201311:12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.11. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/8946","DOI":"10.4230\/LIPIcs.SEA.2018.11"},{"issue":"2","key":"180_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10107-009-0281-x","volume":"126","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: On the relative strength of split, triangle and quadrilateral cuts. Math. Program. 126(2), 281\u2013314 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"180_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-014-0761-5","volume":"149","author":"M Bergner","year":"2015","unstructured":"Bergner, M., Caprara, A., Ceselli, A., Furini, F., L\u00fcbbecke, M.E., Malaguti, E., Traversi, E.: Automatic Dantzig\u2013Wolfe reformulation of mixed integer programs. Math. Program. 149(1), 391\u2013424 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0761-5","journal-title":"Math. Program."},{"key":"180_CR10","doi-asserted-by":"crossref","unstructured":"Bixby, R.E.: A brief history of linear and mixed-integer programming computation. Documenta Mathematica, 107\u2013121 (2012)","DOI":"10.4171\/dms\/6\/16"},{"key":"180_CR11","first-page":"12","volume":"58","author":"RE 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 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"02","key":"180_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"RE Bixby","year":"2007","unstructured":"Bixby, R.E., Rothberg, E.: Progress in computational mixed integer programming: a look back from the other side of the tipping point. Ann. Oper. Res. 149(02), 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"180_CR13","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. Comput. 4(2), 151\u2013179 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0037-0","journal-title":"Math. Program. Comput."},{"issue":"2","key":"180_CR14","doi-asserted-by":"publisher","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. Program. 113(2), 241\u2013257 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0051-y","journal-title":"Math. Program."},{"issue":"2","key":"180_CR15","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.N.: On the separation of split cuts and related inequalities. Math. Program. 94(2), 279\u2013294 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0320-3","journal-title":"Math. Program."},{"key":"180_CR16","unstructured":"Center, I.K.: Deterministic time limit. https:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.6.3\/ilog.odms.cplex.help\/CPLEX\/Parameters\/topics\/DetTiLim.html. Accessed 18 Jan 2019"},{"key":"180_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programs. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"180_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s12532-011-0028-6","volume":"3","author":"G Cornu\u00e9jols","year":"2011","unstructured":"Cornu\u00e9jols, G., Nannicini, G.: Practical strategies for generating rank-1 split cuts in mixed-integer linear programming. Math. Program. Comput 3(4), 281\u2013318 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0028-6","journal-title":"Math. Program. Comput"},{"issue":"1","key":"180_CR19","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. 121(1), 33\u201360 (2010). https:\/\/doi.org\/10.1007\/s10107-008-0225-x","journal-title":"Math. Program."},{"issue":"1","key":"180_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-015-0925-y","volume":"154","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Approximating polyhedra with sparse inequalities. Math. Program. 154(1), 329\u2013352 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0925-y","journal-title":"Math. Program."},{"issue":"1","key":"180_CR21","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/moor.2017.0866","volume":"43","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M., Wang, Q.: Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs. Math. Oper. Res. 43(1), 304\u2013332 (2018). https:\/\/doi.org\/10.1287\/moor.2017.0866","journal-title":"Math. Oper. Res."},{"issue":"1","key":"180_CR22","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\u00e1tal closure. Math. Program. 110(1), 3\u201320 (2007). https:\/\/doi.org\/10.1007\/s10107-006-0054-8","journal-title":"Math. Program."},{"issue":"1","key":"180_CR23","doi-asserted-by":"publisher","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. Program. 128(1), 205\u2013230 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0300-y","journal-title":"Math. Program."},{"issue":"2","key":"180_CR24","doi-asserted-by":"publisher","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 mixed-integer cuts. Math. Program. Comput. 3(2), 79\u2013102 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0024-x","journal-title":"Math. Program. Comput."},{"issue":"4","key":"180_CR25","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 J. Comput. 25(4), 808\u2013819 (2013). https:\/\/doi.org\/10.1287\/ijoc.1120.0543","journal-title":"INFORMS J. Comput."},{"key":"180_CR26","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"G Gamrath","year":"2010","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic dantzig-wolfe decomposition for integer programs. In: Festa, P. (ed.) Experimental Algorithms, pp. 239\u2013252. Springer, Berlin (2010)"},{"issue":"2","key":"180_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"180_CR28","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","volume":"2","author":"UH Suhl","year":"1990","unstructured":"Suhl, U.H., Suhl, L.M.: Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. 2(4), 325\u2013335 (1990)","journal-title":"ORSA J. Comput."},{"key":"180_CR29","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-00795-3_2","volume-title":"Operations Research Proceedings 2012","author":"M Walter","year":"2014","unstructured":"Walter, M.: Sparsity of lift-and-project cutting planes. In: Helber, S., Breitner, M., R\u00f6sch, D., Sch\u00f6n, C., Graf von der Schulenburg, J.M., Sibbertsen, P., Steinbach, M., Weber, S., Wolter, A. (eds.) Operations Research Proceedings 2012, pp. 9\u201314. Springer, Cham (2014)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00180-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-020-00180-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00180-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T02:03:37Z","timestamp":1695866617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-020-00180-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00180-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,4]]},"assertion":[{"value":"21 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}