{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:39:18Z","timestamp":1768081158730,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T00:00:00Z","timestamp":1163548800000},"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":[[2008,6]]},"DOI":"10.1007\/s10107-006-0049-5","type":"journal-article","created":{"date-parts":[[2006,11,14]],"date-time":"2006-11-14T10:47:55Z","timestamp":1163501275000},"page":"219-240","source":"Crossref","is-referenced-by-count":81,"title":["Optimizing over the split closure"],"prefix":"10.1007","volume":"113","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anureet","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,15]]},"reference":[{"issue":"6","key":"49_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"R.K. Ahuja","year":"2004","unstructured":"Ahuja R.K., Orlin J.B., Pallottino S., Scaparra M.P., Scutell\u00e0 M.G. (2004) A multi-exchange heuristic for the single source capacitated facility location problem. Manage. Sci. 50(6): 749\u2013760","journal-title":"Manage. Sci."},{"key":"49_CR2","doi-asserted-by":"crossref","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. (2005) Split closure and intersection cuts. Math. Program. A 102, 457\u2013493","journal-title":"Math. Program. A"},{"key":"49_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk A. (2001) Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29, 107\u2013114","journal-title":"Oper. Res. Lett."},{"key":"49_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk A., Mun\u00f3z J.C. (2004) A study of the lot-sizing polytope. Math. Prog. 99, 443\u2013465","journal-title":"Math. Prog."},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk A., Rajan D. (2002) On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333","journal-title":"Math. Program."},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E. (1979) Disjunctive programming. Ann. Discrete Math. 5, 3\u201351","journal-title":"Ann. Discrete Math."},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G. (1993) A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324","journal-title":"Math. Program."},{"key":"49_CR8","doi-asserted-by":"crossref","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. (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42, 1229\u20131246","journal-title":"Manage. Sci."},{"issue":"3","key":"49_CR9","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"103","author":"E. Balas","year":"2005","unstructured":"Balas E., de Souza C. (2005) The vertex separator problem: a polyhedral investigation. Math. Program. 103(3): 583\u2013608","journal-title":"Math. Program."},{"key":"49_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E. Balas","year":"2002","unstructured":"Balas E., Perregaard M. (2002) Lift and project for mixed 0\u20131 programming: recent progress. Discrete Appl. Math. 123, 129\u2013154","journal-title":"Discrete Appl. Math."},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas E., Perregaard M. (2003) A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0\u20131 programming. Math. Program. B 94, 221\u2013245","journal-title":"Math. Program. B"},{"key":"49_CR12","unstructured":"Balas, E., Saxena, A. Separation functions in disjunctive programming (in preparation)"},{"key":"49_CR13","unstructured":"Beasley, J.E. OR-Library, people.brunel.ac.uk\/\u223cmastjjb\/jeb\/info.html"},{"key":"49_CR14","unstructured":"Berkeley Computational Optimization Lab, http:\/\/ieor.berkeley.edu\/~atamturk\/data"},{"key":"49_CR15","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"B. Bonami","year":"2005","unstructured":"Bonami B., Minoux M. (2005) Using rank 1 lift-and-project closures to generate cuts for 0-1 MIP\u2019s, a computational investigation. Discrete optim. 2, 288\u2013308","journal-title":"Discrete optim."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Bonami, P., Cornu\u00e9jols, G., Dash, S., Fischetti, M., Lodi, A. Projected Chv\u00e1tal-Gomory cuts for mixed integer linear programs. Math. Program. A (to appear)","DOI":"10.1007\/s10107-006-0051-y"},{"key":"49_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara A., Letchford A. (2003) On the separation of split cuts and related inequalities. Math. Program. 94, 279\u2013294","journal-title":"Math. Program."},{"key":"49_CR18","unstructured":"COIN: Computational infrastructure for operations research, http:\/\/www.coin-or.org"},{"key":"49_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W.J. Cook","year":"1990","unstructured":"Cook W.J., Kannan R., Schrijver A. (1990) Chvatal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174","journal-title":"Math. Program."},{"key":"49_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G., Li Y. (2001) Elementary closures for integer programs. Oper. Res. Lett. 28, 1\u20138","journal-title":"Oper. Res. Lett."},{"key":"49_CR21","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A. Optimizing over the MIR closure. Talk presented at INFORMS Meeting (San Francisco), November (2005)"},{"issue":"3","key":"49_CR22","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0573-8","volume":"103","author":"C. Souza de","year":"2005","unstructured":"de Souza C., Balas E. (2005) The vertex separator problem: algorithms and computations. Math. Program. 103(3): 609\u2013631","journal-title":"Math. Program."},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A. Optimizing over the first Chv\u00e1tal closure. Math. Program. B (to appear)","DOI":"10.1007\/11496915_2"},{"key":"49_CR24","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K. Holmberg","year":"1999","unstructured":"Holmberg K., Ronnqvist M., Yuan D. (1999) An exact algorithm for the capacited facility location problems with single sourcing. Eur. J. Oper. Res. 113, 544\u2013559","journal-title":"Eur. J. Oper. Res."},{"key":"49_CR25","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0801021","volume":"1","author":"J.L. Nazareth","year":"1991","unstructured":"Nazareth J.L. (1991) The homotopy principle and algorithms for linear programming. SIAM J. Optim. 1, 316\u2013332","journal-title":"SIAM J. Optim."},{"key":"49_CR26","unstructured":"Saxena, A. OSCLIB, http:\/\/www.andrew.cmu.edu\/user\/anureets\/osc\/osc.htm"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0049-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0049-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0049-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:01Z","timestamp":1559109001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0049-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,15]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["49"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0049-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,15]]}}}