{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:01Z","timestamp":1725514201060},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_14","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T09:31:37Z","timestamp":1211535097000},"page":"199-213","source":"Crossref","is-referenced-by-count":14,"title":["Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints"],"prefix":"10.1007","author":[{"given":"Juan Pablo","family":"Vielma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"R.G. Jeroslow","year":"1987","unstructured":"Jeroslow, R.G.: Representability in mixed integer programming 1: characterization results. Discrete Applied Mathematics\u00a017, 223\u2013243 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"R.G. Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modeling with integer variables. Mathematical Programming Study\u00a022, 167\u2013184 (1984)","journal-title":"Mathematical Programming Study"},{"key":"14_CR3","unstructured":"Lowe, J.K.: Modelling with Integer Variables. PhD thesis, Georgia Institute of Technology (1984)"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics\u00a05, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM Journal on Algebraic and Discrete Methods\u00a06, 466\u2013486 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics\u00a089, 3\u201344 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1137\/0131054","volume":"31","author":"C. Blair","year":"1976","unstructured":"Blair, C.: 2 rules for deducing valid inequalities for 0-1 problems. SIAM Journal on Applied Mathematics\u00a031, 614\u2013617 (1976)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"R.G. Jeroslow","year":"1977","unstructured":"Jeroslow, R.G.: Cutting plane theory: disjunctive methods. Annals of Discrete Mathematics\u00a01, 293\u2013330 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"14_CR9","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with Disjunctive Constraints","author":"H.D. Sherali","year":"1980","unstructured":"Sherali, H.D., Shetty, C.M.: Optimization with Disjunctive Constraints. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0181. Springer, Heidelberg (1980)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0167-6377(88)90058-2","volume":"7","author":"E. Balas","year":"1988","unstructured":"Balas, E.: On the convex-hull of the union of certain polyhedra. Operations Research Letters\u00a07, 279\u2013283 (1988)","journal-title":"Operations Research Letters"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01588775","volume":"49","author":"C. Blair","year":"1990","unstructured":"Blair, C.: Representation for multiple right-hand sides. Mathematical Programming\u00a049, 1\u20135 (1990)","journal-title":"Mathematical Programming"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0377-2217(88)90013-6","volume":"36","author":"R.G. Jeroslow","year":"1988","unstructured":"Jeroslow, R.G.: A simplification for some disjunctive formulations. European Journal of Operational Research\u00a036, 116\u2013121 (1988)","journal-title":"European Journal of Operational Research"},{"key":"14_CR13","volume-title":"Integer Programming","author":"R.S. Garfinkel","year":"1972","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Integer Programming. John Wiley & Sons, Inc., Chichester (1972)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L.J. Watters","year":"1967","unstructured":"Watters, L.J.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Operations Research\u00a015, 1171\u20131174 (1967)","journal-title":"Operations Research"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0012-365X(76)90091-1","volume":"16","author":"T. Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discrete Mathematics\u00a016, 39\u201352 (1976)","journal-title":"Discrete Mathematics"},{"key":"14_CR16","volume-title":"Integer and combinatorial optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley-Interscience, Chichester (1988)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E. Balas","year":"2005","unstructured":"Balas, E.: Projection, lifting and extended formulation in integer and combinatorial optimization. Annals of Operations Research\u00a0140, 125\u2013161 (2005)","journal-title":"Annals of Operations Research"},{"key":"14_CR18","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence, J. (ed.) OR 69. Proceedings of the fifth international conference on operational research, pp. 447\u2013454. Tavistock Publications (1970)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.2307\/1905292","volume":"28","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B.: On the significance of solving linear-programming problems with some integer variables. Econometrica\u00a028, 30\u201344 (1960)","journal-title":"Econometrica"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz, H.M., Manne, A.S.: On the solution of discrete programming-problems. Econometrica\u00a025, 84\u2013110 (1957)","journal-title":"Econometrica"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/S0269888901000030","volume":"16","author":"I.R. Farias de Jr.","year":"2001","unstructured":"de Farias Jr., I.R., Johnson, E.L., Nemhauser, G.L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. The Knowledge Engineering Review\u00a016, 25\u201339 (2001)","journal-title":"The Knowledge Engineering Review"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0167-6377(03)00059-2","volume":"32","author":"A.B. Keha","year":"2004","unstructured":"Keha, A.B., de Farias, I.R., Nemhauser, G.L.: Models for representing piecewise linear cost functions. Operations Research Letters\u00a032, 44\u201348 (2004)","journal-title":"Operations Research Letters"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.1060.0277","volume":"54","author":"A.B. Keha","year":"2006","unstructured":"Keha, A.B., de Farias, I.R., Nemhauser, G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Operations Research\u00a054, 847\u2013858 (2006)","journal-title":"Operations Research"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A. Martin","year":"2006","unstructured":"Martin, A., Moller, M., Moritz, S.: Mixed integer models for the stationary case of gas network optimization. Mathematical Programming\u00a0105, 563\u2013582 (2006)","journal-title":"Mathematical Programming"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.disopt.2007.07.001","volume":"5","author":"J.P. Vielma","year":"2008","unstructured":"Vielma, J.P., Keha, A.B., Nemhauser, G.L.: Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optimization\u00a05, 467\u2013488 (2008)","journal-title":"Discrete Optimization"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"K.L. Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science\u00a049, 1268\u20131273 (2003)","journal-title":"Management Science"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-25960-2_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"T.L. Magnanti","year":"2004","unstructured":"Magnanti, T.L., Stratila, D.: Separable concave optimization approximately equals piecewise linear optimization. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 234\u2013243. Springer, Heidelberg (2004)"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00028-6","volume":"27","author":"M. Padberg","year":"2000","unstructured":"Padberg, M.: Approximating separable nonlinear functions via mixed zero-one programs. Operations Research Letters\u00a027, 1\u20135 (2000)","journal-title":"Operations Research Letters"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0167-6377(01)00063-3","volume":"28","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D.: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Operations Research Letters\u00a028, 155\u2013160 (2001)","journal-title":"Operations Research Letters"},{"key":"14_CR30","unstructured":"Wilf, H.S.: Combinatorial algorithms\u2013an update. In: CBMS-NSF regional conference series in applied mathematics. Society for Industrial and Applied Mathematics, vol.\u00a055 (1989)"},{"key":"14_CR31","series-title":"Operations research \/ computer science interfaces series","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4615-4567-5_14","volume-title":"Computing tools for modeling, optimization, and simulation: interfaces in computer science and operations research","author":"J.A. Appleget","year":"2000","unstructured":"Appleget, J.A., Wood, R.K.: Explicit-constraint branching for solving mixed-integer programs. In: Laguna, M., Gonz\u00e1lez Velarde, J.L. (eds.) Computing tools for modeling, optimization, and simulation: interfaces in computer science and operations research. Operations research \/ computer science interfaces series, vol.\u00a012, pp. 245\u2013261. Kluwer Academic, Dordrecht (2000)"},{"key":"14_CR32","unstructured":"Shields, R.: Personal communication (2007)"},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(00)00216-X","volume":"108","author":"J. Lee","year":"2001","unstructured":"Lee, J., Wilson, D.: Polyhedral methods for piecewise-linear functions I: the lambda method. Discrete Applied Mathematics\u00a0108, 269\u2013285 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR34","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0304-0208(08)73476-5","volume-title":"Studies on Graphs and Discrete Programming. Annals of Discrete Mathematics","author":"J. Tomlin","year":"1981","unstructured":"Tomlin, J.: A suggested extension of special ordered sets to non-separable non-convex programming problems. In: Hansen, P. (ed.) Studies on Graphs and Discrete Programming. Annals of Discrete Mathematics, vol.\u00a011, pp. 359\u2013370. North Holland, Amsterdam (1981)"},{"key":"14_CR35","unstructured":"Wilson, D.: Polyhedral methods for piecewise-linear functions. PhD thesis, University of Kentucky (1998)"},{"key":"14_CR36","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/B978-0-12-398050-2.50021-9","volume-title":"Fixed Points: algorithms and applications","author":"M.J. Todd","year":"1977","unstructured":"Todd, M.J.: Union jack triangulations. In: Karamardian, S. (ed.) Fixed Points: algorithms and applications, pp. 315\u2013336. Academic Press, London (1977)"},{"key":"14_CR37","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:17:46Z","timestamp":1620001066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_14","relation":{},"subject":[]}}