{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T23:01:09Z","timestamp":1768086069751,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0166-218x(01)00340-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"129-154","source":"Crossref","is-referenced-by-count":57,"title":["Lift-and-project for Mixed 0\u20131 programming: recent progress"],"prefix":"10.1016","volume":"123","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Perregaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00340-7_BIB1","doi-asserted-by":"crossref","unstructured":"E. Balas, Disjunctive programming: properties of the convex hull of feasible points, Invited paper, with a foreword by G. Cornu\u00e9jols and W. Pulleyblank, Discrete Appl. Math. 89 (1998) 3\u201344 (originally MSRR# 348, Carnegie Mellon University, July 1974).","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB3","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","article-title":"Disjunctive programming and a hierarchy of relaxations for discrete optimization problems","volume":"6","author":"Balas","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02614309","article-title":"A modified lift-and-project procedure","volume":"79","author":"Balas","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB6","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Manag. Sci."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB7","doi-asserted-by":"crossref","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, G. Pataki, Polyhedral methods for the maximum clique problem, in: D. Johnson, M. Trick (Eds.), Clique, Coloring and Satisfiability: The Second DIMACS Challenge, The American Mathematical Society, Providence, RI, 1996, pp. 11\u201327.","DOI":"10.1090\/dimacs\/026\/02"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","article-title":"Strengthening cuts for mixed integer programs","volume":"4","author":"Balas","year":"1980","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01587096","article-title":"Sequential convexification in reverse convex and disjunctive programming","volume":"44","author":"Balas","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB10","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","article-title":"An algorithm for disjunctive programming","volume":"48","author":"Beaumont","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1018960631213","article-title":"Computational experience with parallel mixed integer programming in a distributed environment","volume":"90","author":"Bixby","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB12","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1137\/0131054","article-title":"Two rules for deducing valid inequalities for 0\u20131 programs","volume":"31","author":"Blair","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(80)90037-2","article-title":"Facial disjunctive programs and sequences of cutting planes","volume":"2","author":"Blair","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB14","series-title":"IPCO VI","first-page":"271","article-title":"Solving integer and disjunctive programs by lift-and-project","volume":"Vol. 1412","author":"Ceria","year":"1998"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB15","unstructured":"S. Ceria, J. Soares, Disjunctive cuts for mixed 0\u20131 programming: duality and lifting, GSB, Columbia University, 1997."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB16","unstructured":"S. Ceria, J. Soares, Convex programming for disjunctive optimization, GSB, Columbia University, 1997."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting plane theory: disjunctive methods","volume":"1","author":"Jeroslow","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","article-title":"Representability in mixed integer programming I: characterization results","volume":"17","author":"Jeroslow","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB19","unstructured":"R.G. Jeroslow, Logic based decision support: mixed integer model formulation, Ann. Discrete Math. 40 North-Holland, Amsterdam, 1989."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB20_1","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB20A","unstructured":"G. Pataki, Private communications, March 2001."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB21","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero\u2013one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB22","series-title":"Optimization with disjunctive constraints","volume":"Vol. 181","author":"Sherali","year":"1980"},{"key":"10.1016\/S0166-218X(01)00340-7_BIB23","unstructured":"R.A. Stubbs, S. Mehrotra, A branch-and-cut method for 0\u20131 mixed convex programming, Department of Industrial Engineering, Northwestern University, 1996."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB24","unstructured":"S. Thienel, ABACUS: A branch-and-cut system, Doctoral Dissertation, Faculty of Mathematics and The Natural Sciences, University of Cologne, 1995."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB25","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1021\/ie9600856","article-title":"Disjunctive programming techniques for the optimization of process systems with discontinuous investment costs-multiple size regions","volume":"35","author":"Turkay","year":"1996","journal-title":"Ind. Engng. Chem. Res."},{"key":"10.1016\/S0166-218X(01)00340-7_BIB26","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(94)90341-7","article-title":"An alternative explanation of disjunctive formulations","volume":"72","author":"Williams","year":"1994","journal-title":"European J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:30:42Z","timestamp":1578447042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0166218X01003407"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00340-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}