{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:42:48Z","timestamp":1768081368557,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,12,29]],"date-time":"2004-12-29T00:00:00Z","timestamp":1104278400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10107-004-0558-z","type":"journal-article","created":{"date-parts":[[2004,12,29]],"date-time":"2004-12-29T05:34:13Z","timestamp":1104298453000},"page":"457-493","source":"Crossref","is-referenced-by-count":64,"title":["Split closure and intersection cuts"],"prefix":"10.1007","volume":"102","author":[{"given":"Kent","family":"Andersen","sequence":"first","affiliation":[]},{"given":"G\ufffdrard","family":"Cornu\ufffdjols","sequence":"additional","affiliation":[]},{"given":"Yanjun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,12,29]]},"reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Reduce-and-split cuts: Improving the performance of mixed integer Gomory cuts. Submitted for publication, 2004","DOI":"10.1287\/mnsc.1050.0382"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Oper. Res. 19, 19?39 (1971)","journal-title":"Oper. Res."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3?51 (1979)","journal-title":"Ann. Discrete Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"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 B 94, 221?245 (2003)","journal-title":"Mathematical Programming B"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Gu, Z., Rothberg, E., Wunderling, R.: Mixed integer programming: a progress report. In: M. Gr\u00f6tschel (ed)., The sharpest cut: the impact of Manfred Padberg and his work, MPS\/SIAM Series on Optimization 2004, pp. 309?326","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programs. Mathematical Programming 47, 155?174 (1990)","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1?8 (2001)","journal-title":"Oper. Res. Lett."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s101070100250","volume":"91","author":"Cornu\u00e9jols","year":"2002","unstructured":"Cornu\u00e9jols, G., Li, Y.: On the rank of mixed 0, 1 polyhedra. Mathematical Programming 91, 391?397 (2002)","journal-title":"Mathematical Programming"},{"key":"CR9","unstructured":"Gomory, R.: An algorithm for the mixed integer problem. Techinical Report RM?2597, The Rand Coporation, 1960"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"Nemhauser","year":"1990","unstructured":"Nemhauser, G., Wolsey, L.: A recursive procedure to generate all cuts for 0?1 mixed integer programs. Mathematical Programming 46, 379?390 (1990)","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0558-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0558-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0558-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T01:34:16Z","timestamp":1586050456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0558-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12,29]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["558"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0558-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12,29]]}}}