{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T21:34:38Z","timestamp":1770413678329,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,7,31]],"date-time":"2011-07-31T00:00:00Z","timestamp":1312070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10898-011-9757-3","type":"journal-article","created":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T10:36:17Z","timestamp":1312022177000},"page":"447-469","source":"Crossref","is-referenced-by-count":27,"title":["Reduced RLT representations for nonconvex polynomial programming problems"],"prefix":"10.1007","volume":"52","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[]},{"given":"Evrim","family":"Dalkiran","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,31]]},"reference":[{"issue":"4\u20135","key":"9757_CR1","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti P., Lee J., Liberti L., Margot F., W\u00e4chter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"9757_CR2","unstructured":"Cafieri, S., Hansen, P., Liberti, L., Letocart, L., Messine, F.: Tight and compact convex relaxations for polynomial programming problems. Manuscript, LIX, \u00c9cole Polytechnique, F-91128 Palaiseau, France"},{"issue":"1","key":"9757_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A. Caprara","year":"2010","unstructured":"Caprara A., Locatelli M.: Global optimization problems and domain reduction strategies. Math. Program. 125(1), 123\u2013137 (2010)","journal-title":"Math. Program."},{"key":"9757_CR4","unstructured":"Dalkiran, E.: http:\/\/filebox.vt.edu\/users\/dalkiran\/website\/#ProblemRRLT (2011)"},{"key":"9757_CR5","unstructured":"Dalkiran, E., Sherali, H. D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA (2011)"},{"key":"9757_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-1-4615-2025-2_5","volume-title":"Handbook of Global Optimization","author":"C.A. Floudas","year":"1995","unstructured":"Floudas C.A., Visweswaran V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 217\u2013270. Kluwer, Boston, MA (1995)"},{"issue":"1","key":"9757_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"P.E. Gill","year":"2005","unstructured":"Gill P.E., Murray W., Saunders M.A.: An SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"9757_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10898-004-0864-2","volume":"33","author":"L. Liberti","year":"2005","unstructured":"Liberti L.: Linearity embedded in nonconvex programs. J. Glob. Optim. 33, 157\u2013196 (2005)","journal-title":"J. Glob. Optim."},{"key":"9757_CR9","unstructured":"Liberti, L.: Effective RLT tightening in continuous bilinear programs. Internal Report 2003.18, Politecnico di Milano, 20133 Milano, Italy"},{"key":"9757_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L. Liberti","year":"2006","unstructured":"Liberti L., Pantelides C.C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Glob. Optim. 36, 161\u2013189 (2006)","journal-title":"J. Glob. Optim."},{"key":"9757_CR11","unstructured":"MATLAB: version 7.6.0 (R2008a). The MathWorks Inc., Natick, MA (2008)"},{"issue":"2","key":"9757_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"H.S. Ryoo","year":"1996","unstructured":"Ryoo H.S., Sahinidis N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Glob. Optim."},{"key":"9757_CR13","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON 9.0.6: Global optimization of mixed-integer nonlinear programs. User\u2019s Manual (2010)"},{"key":"9757_CR14","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., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Boston, MA (1999)"},{"key":"9757_CR15","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Dalkiran, E.: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. J. Glob. Optim. (2011). doi: 10.1007\/s10898-010-9639-0","DOI":"10.1007\/s10898-010-9639-0"},{"key":"9757_CR16","unstructured":"Sherali, H.D., Dalkiran, E., Desai, J.: Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts. Comput. Optim. Appl. (accepted for publication)"},{"key":"9757_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali H.D., Fraticelli B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22, 233\u2013261 (2002)","journal-title":"J. Glob. Optim."},{"key":"9757_CR18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0166-218X(99)00225-5","volume":"101","author":"H.D. Sherali","year":"2000","unstructured":"Sherali H.D., Smith J.C., Adams W.P.: Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discrete Appl. Math. 101, 247\u2013267 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9757_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Tuncbilek C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"key":"9757_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali H.D., Tuncbilek C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1\u201331 (1995)","journal-title":"J. Glob. Optim."},{"key":"9757_CR21","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"H.D. Sherali","year":"1997","unstructured":"Sherali H.D., Tuncbilek C.H.: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Glob. Optim. 10, 381\u2013390 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9757_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"H.D. Sherali","year":"1997","unstructured":"Sherali H.D., Tuncbilek C.H.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1\u20139 (1997)","journal-title":"Oper. Res. Lett."},{"key":"9757_CR23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"N.Z. Shor","year":"1990","unstructured":"Shor N.Z.: Dual quadratic estimates in polynomial and Boolen programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"key":"9757_CR24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M. Tawarmalani","year":"2005","unstructured":"Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9757-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9757-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9757-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T16:01:12Z","timestamp":1560441672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9757-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,31]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9757"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9757-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,31]]}}}