{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T14:55:49Z","timestamp":1772290549095,"version":"3.50.1"},"publisher-location":"Boston, MA","reference-count":50,"publisher":"Springer US","isbn-type":[{"value":"9780387747583","type":"print"},{"value":"9780387747590","type":"electronic"}],"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_559","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:09:38Z","timestamp":1219662578000},"page":"3263-3268","source":"Crossref","is-referenced-by-count":13,"title":["Reformulation-Linearization Technique for Global Optimization"],"prefix":"10.1007","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"559_CR1_559","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A\u00a0Level-2 Reformulation-Linearization\n\t    Technique Bound for the Quadratic Assignment Problem. Eur J Oper Res 180(3):983\u2013996","journal-title":"Eur J Oper Res"},{"key":"559_CR2_559","doi-asserted-by":"crossref","unstructured":"Adams WP, Johnson TA (1994) Improved linear programming\u2010based lower bounds for\n\tthe quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS Series in Discret Mathematics and\n\tTheoretical Computer Science, vol\u00a016. Providence, pp 43\u201375","DOI":"10.1090\/dimacs\/016\/02"},{"issue":"2","key":"559_CR3_559","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/moor.23.2.359","volume":"23","author":"WP Adams","year":"1998","unstructured":"Adams WP, Lassiter\n\t    JB, Sherali HD (1998) Persistency in 0-1 optimization. Math Oper Res 23(2):359\u2013389","journal-title":"Math Oper Res"},{"issue":"10","key":"559_CR4_559","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A\u00a0tight linearization and an algorithm for zero-one quadratic programming\n\t    problems. Manage Sci 32(10):1274\u20131290","journal-title":"Manage Sci"},{"issue":"2","key":"559_CR5_559","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams WP, Sherali HD (1990) Linearization strategies for a\u00a0class of zero-one mixed integer programming\n\t    problems. Oper Res 38(2):217\u2013226","journal-title":"Oper Res"},{"issue":"3","key":"559_CR6_559","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams WP, Sherali HD\n\t    (1993) Mixed-integer bilinear programming problems. Math Program 59(3):279\u2013306","journal-title":"Math Program"},{"issue":"1","key":"559_CR7_559","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10479-005-3966-4","volume":"140","author":"WP Adams","year":"2005","unstructured":"Adams WP, Sherali HD (2005) A\u00a0hierarchy of relaxations leading to the convex hull\n\t    representation for general discrete optimization problems. Ann Oper Res 140(1):21\u201347","journal-title":"Ann Oper Res"},{"issue":"3","key":"559_CR8_559","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\n\t    Program 58(3):295\u2013324","journal-title":"Math Program"},{"key":"559_CR9_559","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0167-6377(90)90044-6","volume":"9","author":"E Boros","year":"1990","unstructured":"Boros E, Crama Y, Hammer\n\t    PL (1990) Upper bounds for quadratic 0-1 maximization problems. Oper Res Lett 9:73\u201379","journal-title":"Oper Res Lett"},{"issue":"1","key":"559_CR10_559","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1111\/j.1475-3995.2004.00438.x","volume":"11","author":"L Liberti","year":"2004","unstructured":"Liberti L (2004) Reduction constraints for the global optimization of NLPs. Int Trans Oper Res\n\t    11(1):34\u201341","journal-title":"Int Trans Oper Res"},{"key":"559_CR11_559","doi-asserted-by":"crossref","unstructured":"Liberti L (2004) Reformulation and convex relaxation techniques for global\n\toptimization. 4OR 2:255\u2013258","DOI":"10.1007\/s10288-004-0038-6"},{"issue":"2","key":"559_CR12_559","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10898-004-0864-2","volume":"33","author":"L Liberti","year":"2005","unstructured":"Liberti L (2005)\n\t    Linearity embedded in nonconvex programs. J\u00a0Glob Optim 33(2):157\u2013196","journal-title":"J Glob Optim"},{"key":"559_CR13_559","doi-asserted-by":"crossref","unstructured":"Liberti L (2007) Compact linearization of binary quadratic\n\tproblems. 4OR. doi: 10.1007\/s10288-006-0015-3","DOI":"10.1007\/s10288-006-0015-3"},{"key":"559_CR14_559","unstructured":"Liberti L, Lavor C, Maculan N, Chaer Nascimento MA: Reformulation in\n\tmathematical programming: an application to quantum chemistry. Discret Appl Math, submitted"},{"key":"559_CR15_559","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L Liberti","year":"2006","unstructured":"Liberti L, Pantelides CC (2006) An exact reformulation algorithm for large nonconvex NLPs involving bilinear\n\t    terms. J Glob Optim 36:161\u2013189","journal-title":"J Glob Optim"},{"key":"559_CR16_559","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lovasz","year":"1990","unstructured":"Lovasz L, Schrijver A\n\t    (1990) Cones of matrices and set functions, and 0-1 optimization. SIAM J Optim 1:166\u2013190","journal-title":"SIAM J Optim"},{"issue":"1","key":"559_CR17_559","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali HD (1997) Convex envelopes of multilinear functions over a\u00a0unit hypercube and\n\t    over special discrete sets. Acta Math Vietnamica 22(1):245\u2013270","journal-title":"Acta Math Vietnamica"},{"issue":"3","key":"559_CR18_559","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1008249414776","volume":"12","author":"HD Sherali","year":"1998","unstructured":"Sherali HD (1998) Global optimization of nonconvex polynomial programming problems having\n\t    rational exponents. J\u00a0Glob Optim 12(3):267\u2013283","journal-title":"J Glob Optim"},{"key":"559_CR19_559","first-page":"1","volume-title":"Heuristic Approaches. Handbook of Global Optimization","author":"HD Sherali","year":"2002","unstructured":"Sherali HD (2002) Tight Relaxations for nonconvex optimization problems using the reformulation\u2010linearization\/convexification\n\t  technique (RLT). In: Pardalos PM, Romeijn\u00a0HE (eds) Heuristic Approaches. Handbook of Global Optimization, vol\u00a02. Kluwer, Dordrecht, pp\n\t  1\u201363"},{"issue":"4","key":"559_CR20_559","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","volume":"32","author":"HD Sherali","year":"1984","unstructured":"Sherali HD, Adams WP (1984) A\u00a0decomposition algorithm for a\u00a0discrete location\u2010allocation problem. Oper Res\n\t    32(4):878\u2013900","journal-title":"Oper Res"},{"issue":"3","key":"559_CR21_559","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A\u00a0hierarchy of relaxations\n\t    between the continuous and convex hull representations for zero-one programming problems. SIAM J Discret Math\n\t    3(3):411\u2013430","journal-title":"SIAM J Discret Math"},{"key":"559_CR22_559","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali HD, Adams WP (1994) A\u00a0hierarchy of relaxations and convex hull characterizations for mixed\u2010integer\n\t    zero-one programming problems. Discret Appl Math 52:83\u2013106","journal-title":"Discret Appl Math"},{"key":"559_CR23_559","unstructured":"Sherali HD, Adams WP (1994) A\u00a0reformulation-linearization technique\n\t(RLT) for solving discrete and continuous nonconvex programming problems. In: Gupta O (ed) XII-A\u00a0Mathematics Today, special issue on Recent\n\tAdvances in Mathematical Programming. pp 61\u201378"},{"key":"559_CR24_559","first-page":"1","volume":"49","author":"HD Sherali","year":"1996","unstructured":"Sherali HD, Adams WP (1996) Computational advances using the reformulation-linearization\n\t    technique (RLT) to solve discrete and continuous nonconvex problems. OPTIMA 49:1\u20136","journal-title":"OPTIMA"},{"key":"559_CR25_559","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"HD Sherali","year":"1999","unstructured":"Sherali HD, Adams WP (1999)\n\t    A\u00a0reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Dordrecht"},{"key":"559_CR26_559","unstructured":"Sherali HD, Adams WP (2006) Extension of a\u00a0reformulation\u2010linearization technique (RLT) to semi-infinite and convex\n\tprograms under mixed 0-1 and general discrete restrictions. Manuscript, Dept. of Industrial Systems Engineering, Virginia Polytechnic Institute,\n\tBlacksburg, USA"},{"issue":"3","key":"559_CR27_559","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1287\/opre.46.3.396","volume":"46","author":"HD Sherali","year":"1998","unstructured":"Sherali HD, Adams WP, Driscoll P (1998) Exploiting special structures in constructing\n\t    a\u00a0hierarchy of relaxations for 0-1 mixed integer problems. Oper Res 46(3):396\u2013405","journal-title":"Oper Res"},{"key":"559_CR28_559","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali HD, Alameddine A (1992) A\u00a0new reformulation-linearization technique for solving bilinear programming\n\t    problems. J\u00a0Glob Optim 2:379\u2013410","journal-title":"J Glob Optim"},{"issue":"3","key":"559_CR29_559","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/opre.50.3.433.7739","volume":"50","author":"HD Sherali","year":"2002","unstructured":"Sherali HD, Al-Loughani I, Subramanian S (2002) Global optimization procedures for the\n\t    capacitated Euclidean and l\n                        \n                  p\n                 distance multifacility\n\t    location\u2010allocation problems. Oper Res 50(3):433\u2013448","journal-title":"Oper Res"},{"key":"559_CR30_559","doi-asserted-by":"crossref","unstructured":"Sherali HD, Brown EL (1994) A\u00a0quadratic partial assignment and packing\n\tmodel and algorithm for the airline gate assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS Series\n\tin Discrete Mathematics and Theoretical Computer Science, vol\u00a016. Providence, pp 343\u2013364","DOI":"10.1090\/dimacs\/016\/17"},{"key":"559_CR31_559","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"HD Sherali","year":"2005","unstructured":"Sherali HD, Desai J (2005) A\u00a0global optimization RLT-based approach for solving the hard clustering\n\t    problem. J\u00a0Glob Optim 32:281\u2013306","journal-title":"J Glob Optim"},{"key":"559_CR32_559","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-004-7390-0","volume":"33","author":"HD Sherali","year":"2005","unstructured":"Sherali HD, Desai J (2005) A\u00a0global optimization RLT-based approach for solving the fuzzy clustering\n\t    problem. J\u00a0Glob Optim 33:597\u2013615","journal-title":"J Glob Optim"},{"key":"559_CR33_559","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/0-387-25570-2_5","volume-title":"Essays and Surveys on Global Optimization","author":"HD Sherali","year":"2005","unstructured":"Sherali HD, Desai J (2005) On solving polynomial, factorable, and black-box optimization problems using the RLT methodology. In:\n\t  Audet C, Hansen P, Savard G (eds) Essays and Surveys on Global Optimization. Springer, New York, pp 131\u2013163"},{"issue":"4","key":"559_CR34_559","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1287\/opre.50.4.656.2865","volume":"50","author":"HD Sherali","year":"2002","unstructured":"Sherali HD, Driscoll PJ (2002) On tightening the relaxation of Miller-Tucker-Zemlin\n\t    formulations for asymmetric traveling salesman problems. Oper Res 50(4):656\u2013669","journal-title":"Oper Res"},{"issue":"1\u20134","key":"559_CR35_559","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali HD, Fraticelli BMP (2002) Enhancing RLT relaxations via a\u00a0new class of semidefinite cuts. J\u00a0Glob\n\t    Optim 22(1\u20134):233\u2013261","journal-title":"J Glob Optim"},{"issue":"4","key":"559_CR36_559","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1024792717467","volume":"26","author":"HD Sherali","year":"2003","unstructured":"Sherali HD, Ganesan V (2003) A\u00a0pseudo-global optimization approach with application to the design of\n\t    containerships. J\u00a0Glob Optim 26(4):335\u2013360","journal-title":"J Glob Optim"},{"issue":"2","key":"559_CR37_559","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"HD Sherali","year":"1998","unstructured":"Sherali HD, Krishnamurty R, Al-Khayyal FA (1998) Enumeration approach for linear\n\t    complementarity problems based on a\u00a0reformulation-linearization technique. J\u00a0Optim Theory Appl\n\t    99(2):481\u2013507","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"559_CR38_559","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"HD Sherali","year":"1995","unstructured":"Sherali HD, Lee Y (1995) Sequential and simultaneous liftings of minimal cover inequalities\n\t    for GUB constrained knapsack polytopes. SIAM J Discret Math 8(1):133\u2013153","journal-title":"SIAM J Discret Math"},{"key":"559_CR39_559","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"HD Sherali","year":"1996","unstructured":"Sherali HD, Lee Y (1996) Tighter representations for set partitioning problems via a\u00a0reformulation-linearization\n\t    approach. Discret Appl Math 68:153\u2013167","journal-title":"Discret Appl Math"},{"issue":"1","key":"559_CR40_559","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","volume":"17","author":"HD Sherali","year":"1995","unstructured":"Sherali HD, Lee Y, Adams WP (1995) A\u00a0Simultaneous lifting strategy for identifying new\n\t    classes of facets for the Boolean quadric polytope. Oper Res Lett 17(1):19\u201326","journal-title":"Oper Res Lett"},{"issue":"1\u20133","key":"559_CR41_559","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0166-218X(94)90218-6","volume":"49","author":"HD Sherali","year":"1994","unstructured":"Sherali HD, Ramachandran S, Kim S (1994) A\u00a0localization and\n\t    reformulation discrete programming approach for the rectilinear distance location\u2010allocation problem. Discret Appl Math\n\t    49(1\u20133):357\u2013378","journal-title":"Discret Appl Math"},{"key":"559_CR42_559","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.disopt.2005.10.004","volume":"3","author":"HD Sherali","year":"2006","unstructured":"Sherali HD, Sarin SC, Tsai PF (2006) A\u00a0class of lifted path and flow-based formulations\n\t    for the asymmetric traveling salesman problem with and without precedence constraints. Discret Optim 3:20\u201332","journal-title":"Discret Optim"},{"key":"559_CR43_559","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008207817095","volume":"11","author":"HD Sherali","year":"1997","unstructured":"Sherali HD,\n\t    Smith EP (1997) A\u00a0global optimization approach to a\u00a0water distribution network problem. J\u00a0Glob Optim\n\t    11:107\u2013132","journal-title":"J Glob Optim"},{"key":"559_CR44_559","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008368330827","volume":"19","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Subramanian S, Loganathan GV (2001) Effective relaxations and partitioning schemes\n\t    for solving water distribution network design problems to global optimality. J Glob Optim\n\t    19:1\u201326","journal-title":"J Glob Optim"},{"key":"559_CR45_559","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali HD, Tuncbilek CH (1992) A\u00a0global optimization algorithm for polynomial programming problems using\n\t    a\u00a0reformulation-linearization technique. J\u00a0Glob\n\t    Optim 2:101\u2013112","journal-title":"J Glob Optim"},{"key":"559_CR46_559","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-O","volume":"39","author":"HD Sherali","year":"1992","unstructured":"Sherali HD,\n\t    Tuncbilek CH (1992) A\u00a0squared-Euclidean distance location\u2010allocation problem. Nav Res Logist 39:447\u2013469","journal-title":"Nav Res Logist"},{"key":"559_CR47_559","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali HD, Tuncbilek CH (1995) A\u00a0reformulation\u2010convexification approach for solving nonconvex quadratic\n\t    programming problems. J\u00a0Glob Optim 7:1\u201331","journal-title":"J Glob Optim"},{"issue":"1","key":"559_CR48_559","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"HD Sherali","year":"1997","unstructured":"Sherali HD, Tuncbilek CH (1997) New reformulation-linearization technique based relaxations\n\t    for univariate and multivariate polynomial programming problems. Oper Res Lett 21(1):1\u201310","journal-title":"Oper Res Lett"},{"issue":"3","key":"559_CR49_559","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Wang H (2001) Global optimization of nonconvex factorable programming problems. Math Program\n\t    89(3):459\u2013478","journal-title":"Math Program"},{"key":"559_CR50_559","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs RA, Mehrotra\n\t    S (1999) A\u00a0branch-and-cut method for 0-1 mixed convex programming. Math Program 86:515\u2013532","journal-title":"Math Program"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:02:33Z","timestamp":1720692153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_559","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}