{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:14:10Z","timestamp":1742926450547,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":39,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_134","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:05:19Z","timestamp":1219662319000},"page":"784-787","source":"Crossref","is-referenced-by-count":1,"title":["Disjunctive Programming"],"prefix":"10.1007","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"134_CR1_134","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A\u00a0tight linearization and an algorithm for zero-one quadratic programming problems. Managem Sci 32(10):1274\u20131290","journal-title":"Managem. Sci."},{"issue":"2","key":"134_CR2_134","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"Adams WP, Sherali HD (1990) Linearization strategies for a\u00a0class of zero-one mixed integer programming problems. Oper Res 38(2):217\u2013226","journal-title":"Oper. Res."},{"key":"134_CR3_134","unstructured":"Balas E (1974) Disjunctive programming: Properties of the convex hull of feasible points. Managem Sci Res Report GSIA Carnegie-Mellon Univ 348, no. July"},{"key":"134_CR4_134","unstructured":"Balas E (1974) Intersection cuts from disjunctive constraints. Managem Sci Res Report Carnegie-Mellon Univ 330, no. Feb"},{"key":"134_CR5_134","volume-title":"Nonlinear Programming","author":"E. Balas","year":"1975","unstructured":"Balas E (1975) Disjunctive programming: Cutting planes from logical conditions. In: Mangasarian OL, Meyer RR, Robinson SM (eds) Nonlinear Programming. Acad. Press, New York"},{"key":"134_CR6_134","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E (1985) Disjunctive programming and a\u00a0hierarchy of relaxations for discrete optimization problems. SIAM J Alg Discrete Meth 6:466\u2013485","journal-title":"SIAM J. Alg. Discrete Meth."},{"issue":"1-3","key":"134_CR7_134","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02614309","volume":"79","author":"E. Balas","year":"1997","unstructured":"Balas E (1997) A\u00a0modified lift-and-project procedure. Math Program 79(1\u20133):19\u201332","journal-title":"Math. Program."},{"key":"134_CR8_134","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E, Ceria S, Cornuejols G (1993) A\u00a0lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program 58:295\u2013324","journal-title":"Math. Program."},{"issue":"4","key":"134_CR9_134","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1080\/095119296131616","volume":"9","author":"P. Baptiste","year":"1996","unstructured":"Baptiste P, Lepape C (1996) Disjunctive constraints for manufacturing scheduling: Principles and extensions. Internat J Comput Integrated Manufacturing 9(4):306\u2013310","journal-title":"Internat. J. Comput. Integrated Manufacturing"},{"key":"134_CR10_134","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F. Glover","year":"1973","unstructured":"Glover F (1973) Convexity cuts and cut search. Oper Res 21:123\u2013134","journal-title":"Oper. Res."},{"key":"134_CR11_134","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02026599","volume":"18","author":"F. Glover","year":"1974","unstructured":"Glover F (1974) Polyhedral convexity cuts and negative edge extensions. Z Oper Res 18:181\u2013186","journal-title":"Z. Oper. Res."},{"key":"134_CR12_134","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01681342","volume":"8","author":"F. Glover","year":"1975","unstructured":"Glover F (1975) Polyhedral annexation in mixed integer and combinatorial programming. Math Program 8:161\u2013188 (See also MSRS Report 73-9, Univ. Colorado, August, 1973).","journal-title":"Math. Program."},{"issue":"Suppl.","key":"134_CR13_134","doi-asserted-by":"publisher","first-page":"S339","DOI":"10.1016\/0098-1354(96)00067-1","volume":"20","author":"I.E. Grossmann","year":"1996","unstructured":"Grossmann IE, Turkay M (1996) Solution of algebraic systems of disjunctive equations. Comput Chem Eng 20, Suppl.:S339\u2013S344","journal-title":"Computers Chem. Engin."},{"issue":"1","key":"134_CR14_134","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/02331939408844006","volume":"31","author":"S. Helbig","year":"1994","unstructured":"Helbig S (1994) Stability in disjunctive optimization II. Continuity of the feasible and optimal set. Optim 31(1):63\u201393","journal-title":"Optim."},{"key":"134_CR15_134","unstructured":"Jeroslow RG (1977) A\u00a0cutting plane game and its algorithms. Discussion Paper Center Oper Res and Econometrics Univ Catholique de Louvain 7724, no. June"},{"key":"134_CR16_134","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","volume":"1","author":"R.G. Jeroslow","year":"1977","unstructured":"Jeroslow RG (1977) Cutting plane theory: Disjunctive methods. Ann Discret Math 1:293\u2013330","journal-title":"Ann. Discret Math."},{"key":"134_CR17_134","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lovasz","year":"1991","unstructured":"Lovasz L, Schrijver A (1991) Cones of matrices and set functions and 0-1 optimization. SIAM J Optim 1:166\u2013190","journal-title":"SIAM J. Optim."},{"key":"134_CR18_134","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"A. Majthay","year":"1974","unstructured":"Majthay A, Whinston A (1974) Quasi-concave minimization subject to linear constraints. Discret Math 9:35\u201359","journal-title":"Discret Math."},{"key":"134_CR19_134","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018979717390","volume":"71","author":"K. Mcaloon","year":"1997","unstructured":"Mcaloon K, Tretkoff C (1997) Logic, modeling, and programming. Ann Oper Res 71:335\u2013372","journal-title":"Ann. Oper. Res."},{"key":"134_CR20_134","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF00934290","volume":"11","author":"G. Owen","year":"1973","unstructured":"Owen G (1973) Cutting planes for programs with disjunctive constraints. Optim Theory Appl 11:49\u201355","journal-title":"Optim. Theory Appl."},{"issue":"8","key":"134_CR21_134","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0098-1354(96)00318-3","volume":"21","author":"J.M. Pinto","year":"1997","unstructured":"Pinto JM, Grossmann IE (1997) A\u00a0logic based approach to scheduling problems with resource constraints. Comput Chem Eng 21(8):801\u2013818","journal-title":"Computers Chem. Engin."},{"key":"134_CR22_134","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1002\/nav.3800310408","volume":"31","author":"B. Ramarao","year":"1984","unstructured":"Ramarao B, Shetty CM (1984) Application of disjunctive programming to the linear complementarity problem. Naval Res Logist Quart 31:589\u2013600","journal-title":"Naval Res. Logist. Quart."},{"issue":"3","key":"134_CR23_134","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0743-1066(96)00120-3","volume":"32","author":"C. Sakama","year":"1997","unstructured":"Sakama C, Seki H (1997) Partial deduction in disjunctive logic programming. J\u00a0Logic Programming 32(3):229\u2013245","journal-title":"J. Logic Programming"},{"issue":"1","key":"134_CR24_134","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/BF02591860","volume":"31","author":"S. Sen","year":"1985","unstructured":"Sen S, Sherali HD (1985) On the convergence of cutting plane algorithms for a\u00a0class of nonconvex mathematical programs. Math Program 31(1):42\u201356","journal-title":"Math. Program."},{"issue":"1","key":"134_CR25_134","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01582164","volume":"34","author":"S. Sen","year":"1986","unstructured":"Sen S, Sherali HD (1986) Facet inequalities from simple disjunctions in cutting plane theory. Math Program 34(1):72\u201383","journal-title":"Math. Program."},{"key":"134_CR26_134","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","volume":"32","author":"H.D. Sherali","year":"1984","unstructured":"Sherali HD, Adams WP (1984) A\u00a0decomposition algorithm for a\u00a0discrete location-allocation problem. Oper Res 32(878\u2013900","journal-title":"Oper. Res."},{"issue":"3","key":"134_CR27_134","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A\u00a0hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discret Math 3(3):411\u2013430","journal-title":"SIAM J. Discret Math."},{"key":"134_CR28_134","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H. Sherali","year":"1994","unstructured":"Sherali H, Adams WP (1994) A\u00a0hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl Math 52:83\u2013106 Manuscript, Virginia Polytechnic Inst. State Univ., 1989.","journal-title":"Discrete Appl. Math."},{"key":"134_CR29_134","first-page":"1","volume":"49","author":"H.D. Sherali","year":"1996","unstructured":"Sherali HD, Adams WP (1996) Computational advances using the reformulation-linearization technique (RLT) to solve discrete and continuous nonconvex problems. OPTIMA 49:1\u20136","journal-title":"OPTIMA"},{"issue":"3","key":"134_CR30_134","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/opre.46.3.396","volume":"46","author":"H.D. Sherali","year":"1998","unstructured":"Sherali HD, Adams WP, Driscoll P (1998) Exploiting special structures in constructing a\u00a0hierarchy of relaxations for 0-1 mixed integer problems. Oper Res 46(3):396\u2013405","journal-title":"Oper. Res."},{"issue":"2","key":"134_CR31_134","first-page":"83","volume":"22","author":"H.D. Sherali","year":"1985","unstructured":"Sherali HD, Sen S (1985) A\u00a0disjunctive cutting plane algorithm for the extreme point mathematical programming problem. Opsearch (Theory) 22(2):83\u201394","journal-title":"Opsearch (Theory)"},{"issue":"4","key":"134_CR32_134","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1287\/opre.33.4.928","volume":"33","author":"H.D. Sherali","year":"1985","unstructured":"Sherali HD, Sen S (1985) On generating cutting planes from combinatorial disjunctions. Oper Res 33(4):928\u2013933","journal-title":"Oper. Res."},{"key":"134_CR33_134","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"Sherali HD, Shetty CM (1980) A\u00a0finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. Math Program 19:14\u201331","journal-title":"Math. Program."},{"issue":"3","key":"134_CR34_134","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1002\/nav.3800270310","volume":"27","author":"H.D. Sherali","year":"1980","unstructured":"Sherali HD, Shetty CM (1980) On the generation of deep disjunctive cutting planes. Naval Res Logist Quart 27(3):453\u2013475","journal-title":"Naval Res. Logist. Quart."},{"key":"134_CR35_134","series-title":"Lecture Notes Economics and Math. 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 HD, Shetty CM (1980) Optimization with disjunctive constraints. Lecture Notes Economics and Math Systems, vol\u00a0181. Springer, Berlin"},{"key":"134_CR36_134","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0166-218X(82)90071-3","volume":"4","author":"H.D. Sherali","year":"1982","unstructured":"Sherali HD, Shetty CM (1982) A\u00a0finitely convergent procedure for facial disjunctive programs. Discrete Appl Math 4:135\u2013148","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"134_CR37_134","first-page":"129","volume":"20","author":"H.D. Sherali","year":"1983","unstructured":"Sherali HD, Shetty CM (1983) Nondominated cuts for disjunctive programs and polyhedral annexation methods. Opsearch (Theory) 20(3):129\u2013144","journal-title":"Opsearch (Theory)"},{"issue":"Suppl.","key":"134_CR38_134","first-page":"S427","volume":"21","author":"A. Vecchietti","year":"1997","unstructured":"Vecchietti A, Grossmann IE (1997) LOGMIP: A\u00a0disjunctive 0\u20111 nonlinear optimizer for process systems models. Comput Chem Eng 21, Suppl.:S427\u2013S432","journal-title":"Computers Chem. Engin."},{"issue":"1","key":"134_CR39_134","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0377-2217(94)90341-7","volume":"72","author":"H.P. Williams","year":"1994","unstructured":"Williams HP (1994) An alternative explanation of disjunctive formulations. Europ J Oper Res 72(1):200\u2013203","journal-title":"Europ. J. Oper. Res."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:11:39Z","timestamp":1720696299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_134"}},"subtitle":["DP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_134","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}