{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:57:57Z","timestamp":1743119877134,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540682745"},{"type":"electronic","value":"9783540682790"}],"license":[{"start":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T00:00:00Z","timestamp":1257465600000},"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":[[2010]]},"DOI":"10.1007\/978-3-540-68279-0_10","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T14:18:28Z","timestamp":1257517108000},"page":"283-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Disjunctive Programming"],"prefix":"10.1007","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-006-0709-5","volume":"108","author":"A. Atamt\u00fcrk","year":"2006","unstructured":"A. Atamt\u00fcrk, Strong formulations of robust mixed 0-1 programming, Mathematical Programming 108 (2006) 235\u2013250.","journal-title":"Mathematical Programming"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"K. Andersen, Q. Louveaux, R. Weismantel and L.A. Wolsey, Inequalities from two rows of the simplex tableau, Integer Programming and Combinatorial Optimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 1\u201316.","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"E. Balas, An additive algorithm for solving linear programs in 0-1 variables, Operations Research 13 (1965) 517\u2013546.","journal-title":"Operations Research"},{"key":"10_CR4","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 Journal on Algebraic and Discrete Methods 6 (1985) 466\u2013486.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"1-3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"Egon Balas","year":"1998","unstructured":"E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Invited paper with a Foreword by G. Cornu\u00e9jols and G. Pulleyblank, Discrete Applied Mathematics 89 (1998) 1\u201344.","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"E. Balas and P. Bonami, New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing, Integer Programming and Combinatorial Oprtimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 89\u2013103.","DOI":"10.1007\/978-3-540-72792-7_8"},{"key":"10_CR7","unstructured":"V. Borozan and G. Cornu\u00e9jols, Minimal inequalities for integer constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007."},{"key":"10_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-1 programs, Mathematical Programming 58 (1993) 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols and N. Natraj, Gomory cuts revisited, Operations Research Letters 19 (1996) 1\u201310.","journal-title":"Operations Research Letters"},{"key":"10_CR10","unstructured":"M. Ball, W. Liu and W.R. Pulleyblank, Two-terminal Steiner tree polyhedra, Contributions to Operations Research and Economics, MIT Press, 1989, pp. 251\u2013284."},{"key":"10_CR11","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, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495\u2013516.","journal-title":"Networks"},{"key":"10_CR12","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, The perfectly matchable subgraph polytope of an arbitrary graph, Combinatorica 9 (1989) 321\u2013337.","journal-title":"Combinatorica"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"E. Balas and M. Perregaard, A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming, Mathematical Programming 94 (2003) 221\u2013245.","journal-title":"Mathematical Programming"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"G. Cornu\u00e9jols and F. Margot, On the facets of mixed integer programs with two integer variables and two constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007.","DOI":"10.1007\/s10107-008-0221-1"},{"key":"10_CR15","unstructured":"[COIN-OR] \nhttp:\/\/www.coin-or.org"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-007-0101-0","volume":"114","author":"M. Conforti","year":"2008","unstructured":"M. Conforti and L.A. Wolsey, Compact formulations as a union of polyhedra, Mathematical Programming 114 (2008) 277\u2013289.","journal-title":"Mathematical Programming"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"S.S. Dey and L.A. Wolsey, Lifting integer variables in minimal inequalities corresponding to lattice-free triangles, Integer Programming and Combinatorial Optimization IPCO 13 (A. Lodi, A. Panconesi, and G. Rinaldi, eds.), Springer, 2008, pp. 463\u2013475.","DOI":"10.1007\/978-3-540-68891-4_32"},{"key":"10_CR18","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-1 optimization, SIAM Journal of Optimization 1 (1991) 166\u2013190.","journal-title":"SIAM Journal of Optimization"},{"key":"10_CR19","unstructured":"M. Perregaard, A Practical implementation of lift-and-project cuts: a computational exploration of lift-and-project with XPRESS-MP, International Symposium onMathematical Programming, Copenhagen, August 2003."},{"key":"10_CR20","unstructured":"Y. Pochet and L.A. Wolsey, Production Planning by Mixed Integer Programming, Springer, 2006."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"R. Stubbs and S. Mehrotra, A branch and cut method for 0-1 mixed integer convex programming, Mathematical Programming 86 (1999) 515\u2013532.","journal-title":"Mathematical Programming"}],"container-title":["50 Years of Integer Programming 1958-2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68279-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T22:02:35Z","timestamp":1583532155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68279-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,6]]},"ISBN":["9783540682745","9783540682790"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68279-0_10","relation":{},"subject":[],"published":{"date-parts":[[2009,11,6]]},"assertion":[{"value":"6 November 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}