{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T14:47:29Z","timestamp":1747234049821},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1007\/bf02614309","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:34:10Z","timestamp":1177734850000},"page":"19-31","source":"Crossref","is-referenced-by-count":8,"title":["A modified lift-and-project procedure"],"prefix":"10.1007","volume":"79","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02614309_CR1","unstructured":"E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, MSRR #348, Carnegie Mellon University, July 1974."},{"key":"BF02614309_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"E. Balas, Disjunctive programming,Annals of Discrete Mathematics 5 (1979) 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02614309_CR3","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"E. Balas, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems,SIAM Journal on Algebraic and Discrete Methods 6 (1985) 466\u2013485.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"BF02614309_CR4","unstructured":"E. Balas, Enhancements of lift-and-project, GSIA, Carnegie Mellon University, January 1996."},{"key":"BF02614309_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols, A lift-and-project cutting plane algorithm for mixed 0\u20131 programs,Mathematical Programming 58 (1993) 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"BF02614309_CR6","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols, Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework,Management Science 42 (1996) 1229\u20131246.","journal-title":"Management Science"},{"key":"BF02614309_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/026\/02","volume-title":"Clique, Coloring and Satisfiability: The Second DIMACS Challenge","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols and G. Pataki, Polyhedral methods for the maximum clique problem, in: D. Johnson and M. Trick, eds.,Clique, Coloring and Satisfiability: The Second DIMACS Challenge (The American Mathematical Society, Providence, RI, 1996), 11\u201327."},{"key":"BF02614309_CR8","unstructured":"R. Bixby, W. Cook, A. Cox and E. Lee, Computational experience with parallel mixed integer programming in a distributed environment, Rice University, June 1995, revised December 1996."},{"key":"BF02614309_CR9","unstructured":"S. Ceria, Lift-and-project methods for mixed 0\u20131 programs, Ph.D. Dissertation, GSIA, Carnegie Mellon University, 1993."},{"key":"BF02614309_CR10","unstructured":"S. Ceria and J. Soares, Convex programming for disjunctive optimization, G.S.B., Columbia University, November 1996."},{"key":"BF02614309_CR11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver, Cones of matrices and set functions and 0\u20131 optimization,SIAM Journal on Optimization 1 (1991) 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614309_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"H. Sherali and W. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems,SIAM Journal on Discrete Mathematics 3 (1990) 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02614309_CR13","unstructured":"R.A. Stubbs and S. Mehrotra, A branch-and-cut method for 0\u20131 mixed convex programming, Dept. of IE, Northwestern University, Technical Report 96-01, January 1996."},{"key":"BF02614309_CR14","unstructured":"S. Thienel, ABACUS: A Branch and Cut System, Doctoral Dissertation, Faculty of Mathematics and the Natural Sciences, University of K\u00f6ln, 1995."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614309\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:49:23Z","timestamp":1558342163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["BF02614309"],"URL":"https:\/\/doi.org\/10.1007\/bf02614309","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}