{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:49Z","timestamp":1747579549962},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645900"},{"type":"electronic","value":"9783540693468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_21","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"271-283","source":"Crossref","is-referenced-by-count":11,"title":["Solving Integer and Disjunctive Programs by Lift and Project"],"prefix":"10.1007","author":[{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Pataki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"21_CR1","unstructured":"P. Avella and F. Rossi. Private communication."},{"key":"21_CR2","unstructured":"G. Astfalk and R. Bixby. Private communication."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"E. Balas. Intersection cuts \u2014 A new type of cutting planes for integer programming. Operations Research, 19:19\u201339, 1971.","journal-title":"Operations Research"},{"key":"21_CR4","unstructured":"E. Balas. Disjunctive programming: Facets of the convex hull of feasible points. Technical Report No. 348, GSIA, Carnegie Mellon University, 1974."},{"key":"21_CR5","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. Disjunctive programming. Annals of Discrete Mathematics, 5:3\u201351, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"21_CR6","doi-asserted-by":"publisher","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 J. Alg. Disc. Meth., 6:466\u2013486, 1985.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"21_CR7","unstructured":"E. Balas. Enhancements of lift-and-project. Technical Report, GSIA, Carnegie Mellon University, 1997."},{"key":"21_CR8","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. A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Mathematical Programming, 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"21_CR9","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-ad-project in a branch-and-cut framework. Management Science, 42:1229\u20131246, 1996.","journal-title":"Management Science"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/026\/02","volume":"26","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, and G. Pataki. Polyhedral Methods for the Maximum Clique Problem. AMS, DIMA CS Series on Discrete Mathematics and Computer Science, 26:11\u201328, 1996.","journal-title":"AMS, DIMA CS Series on Discrete Mathematics and Computer Science"},{"key":"21_CR11","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. An algorithm for disjunctive programs. European Journal of Operational Research, 48:362\u2013371, 1990.","journal-title":"European Journal of Operational Research"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1137\/0131054","volume":"31","author":"C. Blair","year":"1976","unstructured":"C. Blair. Two rules for deducing valid inequalities for 0\u20131 problems. SIAM Journal of Applied Mathematics, 31:614\u2013617, 1976.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"21_CR13","unstructured":"S. Ceria and J. Soares. Disjunctive cuts for mixed 0\u20131 programming: Duality and lifting. Working paper, Graduate School of Business, Columbia University, 1997."},{"key":"21_CR14","unstructured":"S. Ceria and J. Soares. Convex programming for disjunctive optimization. Working paper, Graduate School of Business, Columbia University, 1997."},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BFb0023767","volume-title":"Principles and practice of constraint programming","author":"J. Hooker","year":"1992","unstructured":"J. Hooker. Logic based methods for optimization. In A. Borning, editor, Principles and practice of constraint programming, LNCS, Vol. 626, pages 184\u2013200, 1992."},{"key":"21_CR16","unstructured":"J. Hooker, M. Osorio. Mixed logical\/linear programming. Technical report, GSIA, Carnegie Mellon University, 1997."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0305-0548(94)90089-2","volume":"21","author":"J. Hooker","year":"1994","unstructured":"J. Hooker, H. Yan, I. Grossman, and R. Raman. Logic cuts for processing networks with fixed charges. Computers and Operations Research, 21:265\u2013279, 1994.","journal-title":"Computers and Operations Research"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"R. Jeroslow","year":"1987","unstructured":"R. Jeroslow. Representability in mixed-integer programming I: Characterization results. Discrete Applied Mathematics, 17:223\u2013243, 1987.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR19","unstructured":"R. Jeroslow. Logic based decision support: Mixed-integer model formulation. Annals of Discrete Mathematics, 40, 1989."},{"key":"21_CR20","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. Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optimization, 1:166\u2013190, 1991.","journal-title":"SIAM J. Optimization"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01262932","volume":"16","author":"R. Meyer","year":"1975","unstructured":"R. Meyer. Integer and mixed-integer programming models: General properties. Journal of Optimization Theory and Applications, 16:191\u2013206, 1975.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"21_CR22","doi-asserted-by":"publisher","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 J. Disc. Math., 3:411\u2013430, 1990.","journal-title":"SIAM J. Disc. Math."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"H. Sherali and C. Shetty. Optimization with disjunctive constraints, In M. Beckman and H. Kunzi, editors, Lecture notes in Economics and Mathematical Systems, Vol. 181. Springer-Verlag, 1980.","DOI":"10.1007\/978-3-642-48794-1"},{"key":"21_CR24","unstructured":"J. Soares. Disjunctive Methods for Discrete Optimization Problems, PhD thesis, Graduate School of Business, Columbia University, 1997. In preparation."},{"key":"21_CR25","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. An alternative explanation of disjunctive formulations. European Journal of Operational Research, 72:200\u2013203, 1994.","journal-title":"European Journal of Operational Research"},{"key":"21_CR26","unstructured":"L. Wolsey. Private communication."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:06:12Z","timestamp":1556719572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}