{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:47:50Z","timestamp":1755838070650,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428770"},{"type":"electronic","value":"9783540455868"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45586-8_2","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T01:06:11Z","timestamp":1180314371000},"page":"26-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Projection and Lifting in Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"E. Balas, \u201cDisjunctive Programming: Properties of the Convex Hull of Feasible Points.\u201d Invited paper, with a foreword by G. Cornu\u00e9jols and W. Pulleyblank, Discrete Applied Mathematics, 89, 1998, 3\u201344 (originally MSRR# 348, Carnegie Mellon University, July 1974).","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"E. Balas, \u201cDisjunctive Programming.\u201d Annals of Discrete Mathematics, 5, 1979, 3\u201351.","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"E. Balas, \u201cDisjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems.\u201d SIAM Journal on Algebraic and Discrete Methods, 6, 1985, 466\u2013485.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"2_CR4","first-page":"35","volume":"60","author":"E. Balas","year":"1987","unstructured":"E. Balas, \u201cThe Assignable Subgraph Polytope of a Directed Graph.\u201d Congressus Numerantium, 60, 1987, 35\u201342.","journal-title":"Congressus Numerantium"},{"key":"2_CR5","first-page":"19","volume":"79","author":"E. Balas","year":"1997","unstructured":"E. Balas, \u201cA Modified Lift-and-Project Procedure.\u201d Mathematical Programming, 79, 1997, 19\u201331.","journal-title":"Mathematical Programming"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1018368920203","volume":"10","author":"E. Balas","year":"1998","unstructured":"E. Balas, \u201cProjection with a Minimal System of Inequalities.\u201d Computational Optimization and Applications, 10, 1998, 189\u2013193.","journal-title":"Computational Optimization and Applications"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria and G. Cornu\u00e9jols, \u201cA Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs.\u201d Mathematical Programming, 58, 1993, 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"2_CR8","doi-asserted-by":"publisher","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, \u201cMixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework.\u201d Management Science, 42, 1996, 1229\u20131246.","journal-title":"Management Science"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols and G. Pataki, \u201cPolyhedral Methods for the Maximum Clique Problem.\u201d In D. Johnson and M. Trick (editors), Clique, Coloring and Satisfiability: The Second DIMACS Challenge. The American Mathematical Society, Providence, RI, 1996, 11\u201327.","DOI":"10.1090\/dimacs\/026\/02"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E. Balas","year":"1980","unstructured":"E. Balas and R.G. Jeroslow, \u201cStrengthening Cuts for Mixed Integer Programs.\u201d European Journal of Operational Research, 4, 1980, 224\u2013234.","journal-title":"European Journal of Operational Research"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"E. Balas and J.B. Mazzola, \u201cNonlinear 0-1 Programming: I. Linearization Techniques, II. Dominance Relations and Algorithms.\u201d Mathematical Programming, 30, 1984, 1\u201321 and 22-45.","journal-title":"Mathematical Programming"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(98)00096-1","volume":"87","author":"E. Balas","year":"1998","unstructured":"E. Balas and M. Oosten, \u201cOn the Dimension of Projected Polyhedra.\u201d Discrete Applied Mathematics, 87, 1998, 1\u20139.","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2","volume":"36","author":"E. Balas","year":"2000","unstructured":"E. Balas and M. Oosten, \u201cThe Cycle Polytope of a Directed Graph.\u201d Networks, 36, 2000, 34\u201346.","journal-title":"Networks"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W.R. Pulleyblank, \u201cThe Perfectly Matchable Subgraph Polytope of a Bipartite Graph.\u201d Networks, 13, 1983, 495\u2013518.","journal-title":"Networks"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"E. Balas and W.R. Pulleyblank, \u201cThe Perfectly Matchable Subgraph Polytope of an Arbitrary Graph.\u201d Combinatorica, 9, 1989, 321\u2013337.","journal-title":"Combinatorica"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01587096","volume":"44","author":"E. Balas","year":"1989","unstructured":"E. Balas, J. Tama and J. Tind, \u201cSequential Convexification in Reverse Convex and Disjunctive Programming.\u201d Mathematical Programming, 44, 1989, 337\u2013350.","journal-title":"Mathematical Programming"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","volume":"48","author":"N. Beaumont","year":"1990","unstructured":"N. Beaumont, \u201cAn Algorithm for Disjunctive Programming.\u201d European Journal of Operational Research, 48, 1990, 362\u2013371.","journal-title":"European Journal of Operational Research"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1018960631213","volume":"90","author":"R. Bixby","year":"1999","unstructured":"R. Bixby, W. Cook, A. Cox and E. Lee, \u201cComputational Experience with Parallel Mixed Integer Programming in a Distributed Environment.\u201d Annals of Operations Research, 90, 1999, 19\u201345.","journal-title":"Annals of Operations Research"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1137\/0131054","volume":"31","author":"C. Blair","year":"1976","unstructured":"C. Blair, \u201cTwo Rules for Deducing Valid Inequalities for 0-1 Programs.\u201d SIAM Journal of Applied Mathematics, 31, 1976, 614\u2013617.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0166-218X(80)90037-2","volume":"2","author":"C. Blair","year":"1980","unstructured":"C. Blair, \u201cFacial Disjunctive Programs and Sequences of Cutting Planes.\u201d Discrete Applied Mathematics, 2, 1980, 173\u2013180.","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-69346-7_21","volume-title":"IPCO VI","author":"S. Ceria","year":"1998","unstructured":"S. Ceria and G. Pataki, \u201cSolving Integer and Disjunctive Programs by Lift-and-Project.\u201d In R.E. Bixby, E.A. Boyd and R.Z. Rios-Mercado (editors), IPCO VI, Lecture Notes in Computer Science, 1412, Springer 1998, 271\u2013283."},{"key":"2_CR22","unstructured":"S. Ceria and J. Soares, \u201cDisjunctive Cuts for Mixed 0-1 Programming: Duality and Lifting.\u201d GSB, Columbia University, 1997."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"S. Ceria and J. Soares, \u201cConvex Programming for Disjunctive Convex Optimization.\u201d Mathematical Programming, 86, 1999, 595\u2013614.","journal-title":"Mathematical Programming"},{"key":"2_CR24","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, R.D. Fulkerson and S.M. Johnson, \u201cSolution of a Large-Scale Traveling Salesman Problem.\u201d Operations Research, 2, 1954, 393\u2013410.","journal-title":"Operations Research"},{"key":"2_CR25","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"R. Fortet, \u201cApplications de l\u2019alg\u00e9bre de Boolean recherche op\u00e9rationnelle.\u201d Revue Francaise de Recherche Op\u00e9rationnelle, 4, 1960, 17\u201325.","journal-title":"Revue Francaise de Recherche Op\u00e9rationnelle"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"R.G. Jeroslow","year":"1977","unstructured":"R.G. Jeroslow, \u201cCutting Plane Theory: Disjunctive Methods.\u201d Annals of Discrete Mathematics, 1, 1977, 293\u2013330.","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"R.G. Jeroslow","year":"1987","unstructured":"R.G. Jeroslow, \u201cRepresentability in Mixed Integer Programming I: Characterization Results.\u201d Discrete Applied Mathematics, 17, 1987, 223\u2013243.","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR28","unstructured":"R.G. Jeroslow, \u201cLogic Based Decision Support: Mixed Integer Model Formulation.\u201d Annals of Discrete Mathematics, 40, 1989."},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"E.L. Johnson","year":"1974","unstructured":"E.L. Johnson, \u201cThe Group Problem for Mixed-Integer Programming.\u201d Mathematical Programming Study, 2, 1974, 137\u2013179.","journal-title":"Mathematical Programming Study"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"A. Letchford, \u201cOn Disjunctive Cuts for Combinatorial Optimization.\u201d Journal of Combinatorial Optimization, 5, 2001 (Issue 3).","DOI":"10.1023\/A:1011493126498"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"L. Lov\u00e1sz and A. Schrijver, \u201cCones of Matrices and Set Functions and 0-1 Optimization.\u201d SIAM Journal of Optimization, 1, 1991, 166\u2013190.","journal-title":"SIAM Journal of Optimization"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C.E. Miller","year":"1960","unstructured":"C.E. Miller, A.W. Tucker and R.A. Zemlin, \u201cInteger Programming Formulations and Traveling Salesman Problems.\u201d Journal of the ACM, 7, 1960, 326\u2013329.","journal-title":"Journal of the ACM"},{"key":"2_CR33","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley, 1986."},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01582894","volume":"52","author":"M. Padberg","year":"1991","unstructured":"M. Padberg and Ting-Yi Sung, \u201cAn Analytical Comparison of Difierent Formulations of the Traveling Salesman Problem.\u201d Math. Programming, 52, 1991, 315\u2013357.","journal-title":"Math. Programming"},{"key":"2_CR35","unstructured":"G. Pataki, personal communication, March 2001."},{"key":"2_CR36","unstructured":"M. Perregaard and E. Balas, \u201cGenerating Cuts from Multiple-Term Disjunctions.\u201d In K. Aardal and B. Gerards (Editors), Integer Programming and Combinatorial Optimization (8th IPCO Conference, Utrecht, 2001), LCNS No. 2081, Springer, 2001."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"H. Sherali and W. Adams, \u201cA Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems.\u201d SIAM Journal on Discrete Mathematics, 3, 1990, 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"H. Sherali and C. Shetty, Optimization with Disjunctive Constraints. Lecture Notes in Economics and Mathematical Systems, 181, Springer, 1980.","DOI":"10.1007\/978-3-642-48794-1"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I. Springer, 1970.","DOI":"10.1007\/978-3-642-46216-0"},{"key":"2_CR40","unstructured":"R.A. Stubbs and S. Mehrotra, \u201cA Branch-and-Cut Method for 0-1 Mixed Convex Programming.\u201d Department of Industrial Engineering, Northwestern University, 1996."},{"key":"2_CR41","unstructured":"S. Thienel, \u201cABACUS: A Branch-and-Cut System.\u201d Doctoral Dissertation, Faculty of Mathematics and The Natural Sciences, University of Cologne, 1995."},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1021\/ie9600856","volume":"35","author":"M. Turkay","year":"1996","unstructured":"M. Turkay and I.E. Grossmann, \u201cDisjunctive Programming Techniques for the Optimization of Process Systems with Discontinuous Investment Costs-Multiple Size Regions.\u201d Industrial Engineering Chemical Research, 35, 1996, 2611\u20132623.","journal-title":"Industrial Engineering Chemical Research"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0377-2217(94)90341-7","volume":"72","author":"H.P. Williams","year":"1994","unstructured":"H.P. Williams, \u201cAn Alternative Explanation of Disjunctive Formulations.\u201d European Journal of Operational Research, 72, 1994, 200\u2013203.","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Computational Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45586-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:40:32Z","timestamp":1558258832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}