{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:44:19Z","timestamp":1761943459045,"version":"build-2065373602"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,9]],"date-time":"2006-12-09T00:00:00Z","timestamp":1165622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,6]]},"DOI":"10.1007\/s10479-006-0103-y","type":"journal-article","created":{"date-parts":[[2006,12,8]],"date-time":"2006-12-08T15:39:34Z","timestamp":1165592374000},"page":"57-61","source":"Crossref","is-referenced-by-count":3,"title":["A brief history of lift-and-project"],"prefix":"10.1007","volume":"149","author":[{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,9]]},"reference":[{"key":"103_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas, E. (1971). \u201cIntersection Cuts\u2014A New Type of Cutting Planes for Integer Programming.\u201d Operations Research, 19, 19\u201339.","journal-title":"Operations Research"},{"key":"103_CR2","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). \u201cDisjunctive Programming.\u201d Annals of Discrete Mathematics, 5, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"103_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993a","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1993a). \u201cA Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs.\u201d Mathematical Programming, 58, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"103_CR4","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1993b). \u201cSolving Mixed 0-1 Programs by a Lift-and-Project Method.\u201d In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 232\u2013242."},{"key":"103_CR5","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996a","unstructured":"Balas, E., S. Ceria, and G. Cornu\u00e9jols. (1996a). \u201cMixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework.\u201d Management Science, 42, 1229\u20131246.","journal-title":"Management Science"},{"key":"103_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996b","unstructured":"Balas, E., S. Ceria, G. Cornu\u00e9jols, and N.R. Natraj. (1996b). \u201cGomory Cuts Revisited.\u201d Operation Research Letter, 19, 1\u20139.","journal-title":"Operation Research Letter"},{"key":"103_CR7","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E. Balas","year":"1980","unstructured":"Balas, E. and R. Jeroslow. (1980). \u201cStrengthening Cuts for Mixed Integer Programs.\u201d European Journal of Operations Research, 4, 224\u2013234.","journal-title":"European Journal of Operations Research"},{"key":"103_CR8","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0318018","volume":"18","author":"R. Jeroslow","year":"1980","unstructured":"Jeroslow, R. (1980). \u201cA cutting plane game for facial disjunctive programs.\u201d SIAM J. Control and Optimization 18, 264\u2013280.","journal-title":"SIAM J. Control and Optimization"},{"key":"103_CR9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L. and A. Schrijver. (1991). \u201cCones of Matrices and Set-Functions and 0-1 Optimization.\u201d SIAM J. Optimization, 1, 166\u2013190.","journal-title":"SIAM J. Optimization"},{"key":"103_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"Sherali, H. and W. Adams. (1990). \u201cA Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-one Programming Problems.\u201d SIAM J. Disc. Math., 3, 411\u2013430.","journal-title":"SIAM J. Disc. Math."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0103-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0103-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0103-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:35Z","timestamp":1559153255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0103-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,9]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,6]]}},"alternative-id":["103"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0103-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2006,12,9]]}}}