{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:47:09Z","timestamp":1771145229055,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10479-005-3966-4","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T07:12:53Z","timestamp":1132989173000},"page":"21-47","source":"Crossref","is-referenced-by-count":36,"title":["A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems"],"prefix":"10.1007","volume":"140","author":[{"given":"Warren P.","family":"Adams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3966_CR1","unstructured":"Adams, W.P. (1985). \u201cThe Mixed-Integer Bilinear Programming Problem with Extensions to Zero-One Quadratic Programs,\u201d Ph.D. Dissertation, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, VA."},{"key":"3966_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","volume":"16","author":"W.P. Adams","year":"1994","unstructured":"Adams, W.P. and T.A. Johnson. (1994). \u201cImproved Linear Programming-Based Lower Bounds for the Quadratic Assignment Problem.\u201d DIMACS Series in Discrete Mathematical and Theoretical Computer Science 16, 43\u201376.","journal-title":"DIMACS Series in Discrete Mathematical and Theoretical Computer Science"},{"issue":"2","key":"3966_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/moor.23.2.359","volume":"23","author":"W.P. Adams","year":"1998","unstructured":"Adams, W.P., J.B. Lassiter, and H.D. Sherali. (1998). \u201cPersistency in 0-1 Polynomial Programming.\u201d Mathematics of Operations Research 23(2), 359\u2013389.","journal-title":"Mathematics of Operations Research"},{"issue":"10","key":"3966_CR4","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams, W.P. and H.D. Sherali. (1986). \u201cA Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems.\u201d Management Science 32(10), 1274\u20131290.","journal-title":"Management Science"},{"issue":"2","key":"3966_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"Adams, W.P. and H.D. Sherali. (1990). \u201cLinearization Strategies for a Class of Zero-One Mixed Integer Programming Problems.\u201d Operations Research 38(2), 217\u2013226.","journal-title":"Operations Research"},{"issue":"3","key":"3966_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"W.P. Adams","year":"1993","unstructured":"Adams, W.P. and H.D. Sherali. (1993). \u201cMixed-Integer Bilinear Programming Problems.\u201d Mathematical Programming 59(3), 279\u2013305.","journal-title":"Mathematical Programming"},{"issue":"3","key":"3966_CR7","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas, E. (1985). \u201cDisjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems.\u201d SIAM Journal on Algebraic and Discrete Methods 6(3), 466\u2013486.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"3","key":"3966_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., C. Ceria, and G. Cornu\u00e9jols. (1993). \u201cA Lift and Project Cutting Plane Algorithm for Mixed 0-1 Programs.\u201d Mathematical Programming 58(3), 295\u2013324.","journal-title":"Mathematical Programming"},{"key":"3966_CR9","unstructured":"Boros, E., Y. Crama, and P. Hammer. (1989). \u201cUpper Bounds for Quadratic Maximization Problems.\u201d RUTCOR Report RRR #14-89, Rutgers University, New Brunswick, NJ, 08903."},{"issue":"4","key":"3966_CR10","first-page":"5","volume":"1","author":"R. Fortet","year":"1959","unstructured":"Fortet, R. (1959). \u201cL'alg\u00e8bre de Boole et ses applications en Recherche Op\u00e9rationelle.\u201d Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationelle 1(4), 5\u201336.","journal-title":"Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationelle"},{"issue":"14","key":"3966_CR11","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet, R. (1960). \u201cApplications de l'alg\u00e8bre de Boole en Recherche Op\u00e9rationelle.\u201d Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationelle 4(14), 17\u201326.","journal-title":"Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationelle"},{"issue":"4","key":"3966_CR12","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"Glover, F. (1975). \u201cImproved Linear Integer Programming Formulations of Nonlinear Integer Programs.\u201d Management Sci. 22(4), 455\u2013460.","journal-title":"Management Sci."},{"key":"3966_CR13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F. Glover","year":"1973","unstructured":"Glover, F. and E. Woolsey. (1973). \u201cFurther Reduction of Zero-One Polynomial Programming Problems to Zero-One Linear Programming Problems.\u201d Operations Research 21, 156\u2013161.","journal-title":"Operations Research"},{"key":"3966_CR14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover, F. and E. Woolsey. (1974). \u201cConverting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program.\u201d Operations Research 22, 180\u2013182.","journal-title":"Operations Research"},{"issue":"6","key":"3966_CR15","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","volume":"46","author":"P. Hahn","year":"1998","unstructured":"Hahn, P. and T. Grant. (1998). \u201cLower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation.\u201d Operations Research 46(6), 912\u2013922.","journal-title":"Operations Research"},{"issue":"1","key":"3966_CR16","first-page":"41","volume":"11","author":"P. Hahn","year":"2001","unstructured":"Hahn, P., W. Hightower, T.A. Johnson, and M. Guignard-Spielberg. (2001). \u201cTree Elaboration Strategies in Branch and Bound Algorithms for Solving the Quadratic Assignment Problem.\u201d Yugoslav Journal of Operations Research 11(1), 41\u201360.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"3966_CR17","doi-asserted-by":"crossref","unstructured":"Horn, R.A. and C.R. Johnson. (1985). Matrix Analysis. Cambridge University Press, The Pitt Building, Trumpington Street, Cambridge CB2 1RP, 40 West 20th Street, New York, NY 10011.","DOI":"10.1017\/CBO9780511810817"},{"key":"3966_CR18","doi-asserted-by":"crossref","unstructured":"Horn, R.A. and C.R. Johnson. (1991). Topics in Matrix Analysis. Cambridge University Press, The Pitt Building, Trumpington Street, Cambridge CB2 1RP, 40 West 20th Street, New York, NY 10011.","DOI":"10.1017\/CBO9780511840371"},{"key":"3966_CR19","unstructured":"Johnson, T.A. (1992). \u201cNew Linear Programming-Based Solution Procedures for the Quadratic Assignment Problem,\u201d Ph.D. Dissertation, Department of Mathematical Sciences, Clemson University, Clemson, SC."},{"key":"3966_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume-title":"Mathematical Programming Study 9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J. and P.M. Pruzan. (1978). \u201cComputer-Aided Layout Design.\u201d In M.L. Balinski and C. Lemarechal (eds.), Mathematical Programming Study 9, North Holland Publishing Company, Amsterdam, pp. 75\u201394."},{"issue":"2","key":"3966_CR21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"J.B. Lasserre","year":"2002","unstructured":"Lasserre, J.B. (2002). \u201cSemidefinite Programming vs. LP Relaxations for Polynomial Programming.\u201d Mathematics of Operations Research 27(2), 347\u2013360.","journal-title":"Mathematics of Operations Research"},{"key":"3966_CR22","doi-asserted-by":"crossref","unstructured":"Lasserre J.B. (2003). \u201cThe Integer Hull of a Convex Rational Polytope.\u201d Manuscript LAAS-CNRS, Toulouse, France.","DOI":"10.1007\/3-540-44842-X_88"},{"key":"3966_CR23","unstructured":"Laurent, M. (2001). \u201cA Comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre Relaxations for 0-1 Programming.\u201d Technical Report #PNA RO-108, CWI, Amsterdam, Netherlands."},{"key":"3966_CR24","unstructured":"Lougee-Heimer, R. and W.P. Adams. (1999). \u201cA Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs.\u201d IBM Technical Report (IBM T.J. Watson Research Center)."},{"key":"3966_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L. and A. Schrijver. (1991). \u201cCones of Matrices and Set Functions, and 0-1 Optimization.\u201d SIAM Journal on Optimization 1, 166\u2013190.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"3966_CR26","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C.E. Nugent","year":"1968","unstructured":"Nugent, C.E., T.E. Vollmann, and J. Ruml. (1968). \u201cAn Experimental Comparison of Techniques for the Assignment of Facilities to Locations.\u201d Operations Research 16(1), 150\u2013173.","journal-title":"Operations Research"},{"key":"3966_CR27","unstructured":"Peterson, C. (1971). \u201cA Note on Transforming the Product of Variables to Linear Form in Linear Programs.\u201d Working Paper, Purdue University, W. Lafayette, IN."},{"issue":"3","key":"3966_CR28","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D. and W.P. Adams. (1990). \u201cA Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems.\u201d SIAM Journal of Discrete Mathematics 3(3), 411\u2013430.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"3966_CR29","doi-asserted-by":"crossref","unstructured":"Sherali, H.D. and W.P. Adams. (1994). (Manuscript 1989). \u201cA Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems.\u201d Discrete Applied Mathematics 52(1), 83\u2013106.","DOI":"10.1016\/0166-218X(92)00190-W"},{"key":"3966_CR30","first-page":"1","volume":"49","author":"H.D. Sherali","year":"1996","unstructured":"Sherali, H.D. and W.P. Adams. (1996). \u201cComputational Advances on Using the Reformulation-Linearization Technique (RLT) to Solve Various Discrete and Continuous Nonconvex Programming Problems.\u201d Optima, Mathematical Programming Newsletter 49, 1\u20136.","journal-title":"Optima, Mathematical Programming Newsletter"},{"key":"3966_CR31","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":"H.D. Sherali","year":"1999","unstructured":"Sherali, H.D. and W.P. Adams. (1999). A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Dordrecht\/Boston\/London, Kluwer Academic Publishers."},{"issue":"3","key":"3966_CR32","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/opre.46.3.396","volume":"46","author":"H.D. Sherali","year":"1998","unstructured":"Sherali, H.D., W.P. Adams, and P.J. Driscoll. (1998). \u201cExploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems.\u201d Operations Research 46(3), 396\u2013405.","journal-title":"Operations Research"},{"key":"3966_CR33","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D. and A. Alameddine. (1992). \u201cA New Reformulation-Linearization Algorithm for Solving Bilinear Programming Problems.\u201d Journal of Global Optimization 2, 379\u2013410.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"3966_CR34","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"H.D. Sherali","year":"1998","unstructured":"Sherali, H.D., R.S. Krishnamurthy, and F. Al-Khayyal. (1998). \u201cEnumeration Approach for Linear Complementarity Problems Based on a Reformulation-Linearization Technique.\u201d Journal of Optimization Theory and Applications 99(2), 481\u2013507.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3966_CR35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D. and C. Tuncbilek. (1992). \u201cA Global Optimization Algorithm for Polynomial Programming Problems Using a Reformulation-Linearization Technique.\u201d Journal of Global Optimization 2, 101\u2013112.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"3966_CR36","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D. and H. Wang. (2001). \u201cGlobal Optimization of Nonconvex Factorable Programming Problems.\u201d Mathematical Programming 89(3), 459\u2013478.","journal-title":"Mathematical Programming"},{"key":"3966_CR37","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L. Watters","year":"1967","unstructured":"Watters, L. (1967). \u201cReduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems.\u201d Operations Research 15, 1171\u20131174.","journal-title":"Operations Research"},{"key":"3966_CR38","first-page":"30","volume":"5","author":"W. Zangwill","year":"1965","unstructured":"Zangwill, W. (1965). \u201cMedia Selection by Decision Programming.\u201d Journal of Advertising Research 5, 30\u201336.","journal-title":"Journal of Advertising Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3966-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3966-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3966-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:34Z","timestamp":1559138374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3966-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3966"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3966-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}