{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T21:02:59Z","timestamp":1770411779646,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,9]],"date-time":"2013-02-09T00:00:00Z","timestamp":1360368000000},"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":[[2013,12]]},"DOI":"10.1007\/s10898-012-0024-z","type":"journal-article","created":{"date-parts":[[2013,2,9]],"date-time":"2013-02-09T02:36:12Z","timestamp":1360377372000},"page":"1147-1172","source":"Crossref","is-referenced-by-count":14,"title":["Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality"],"prefix":"10.1007","volume":"57","author":[{"given":"Evrim","family":"Dalkiran","sequence":"first","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,9]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"issue":"2\u20133","key":"24_CR2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2\u20133), 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"24_CR3","unstructured":"Applegate, D., Dash, S., Cook, W., Espinoza, D.: QSopt_ex. www.dii.uchile.cl\/~daespino"},{"issue":"4\u20135","key":"24_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4\u20135), 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"24_CR5","first-page":"75","volume-title":"Experimental Algorithms, Lecture Notes in Computer Science","author":"S Cafieri","year":"2012","unstructured":"Cafieri, S., Hansen, P., L\u00e9tocart, L., Liberti, L., Messine, F.: Compact relaxations for polynomial programming problems. In: Klasing, R. (ed.) Experimental Algorithms, Lecture Notes in Computer Science, vol. 7276, pp. 75\u201386. Springer, Berlin (2012)"},{"issue":"1","key":"24_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1111237.1111238","volume":"25","author":"CA Haverly","year":"1978","unstructured":"Haverly, C.A.: Studies of the behavior of recursion for the pooling problem. SIGMAP Bull. 25, 19\u201328 (1978)","journal-title":"SIGMAP Bull."},{"key":"24_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (1981)"},{"key":"24_CR9","unstructured":"ILOG Cplex 12.3: Reference manual, 2012. http:\/\/www.ilog.com\/products\/cplex"},{"issue":"3","key":"24_CR10","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"24_CR11","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"24_CR12","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"24_CR13","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":"24_CR14","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."},{"issue":"2","key":"24_CR15","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"24_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I\u2013Convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2","key":"24_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10898-009-9485-0","volume":"49","author":"PSV Nataraj","year":"2011","unstructured":"Nataraj, P.S.V., Arounassalame, M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. J. Glob. Optim. 49(2), 185\u2013212 (2011)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"24_CR18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10(4), 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"24_CR19","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"24_CR20","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. ACTA Mathematica Vietnamica 22(1), 245\u2013270 (1997)","journal-title":"ACTA Mathematica Vietnamica"},{"key":"24_CR21","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, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Boston (1999)"},{"issue":"3","key":"24_CR22","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10898-010-9639-0","volume":"51","author":"HD Sherali","year":"2011","unstructured":"Sherali, H.D., Dalkiran, E.: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. J. Glob. Optim. 51(3), 377\u2013393 (2011)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"24_CR23","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10589-011-9425-z","volume":"52","author":"HD Sherali","year":"2012","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. 52(2), 483\u2013506 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"24_CR24","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10898-011-9757-3","volume":"52","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Dalkiran, E., Liberti, L.: Reduced RLT representations for nonconvex polynomial programs. J. Glob. Optim. 52(3), 447\u2013469 (2012)","journal-title":"J. Glob. Optim."},{"issue":"1\u20134","key":"24_CR25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD 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(1\u20134), 233\u2013261 (2002)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"24_CR26","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD 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."},{"issue":"1","key":"24_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"HD 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."},{"issue":"3","key":"24_CR28","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89(3), 459\u2013478 (2001)","journal-title":"Math. Program."},{"key":"24_CR29","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"key":"24_CR30","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"24_CR31","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."},{"issue":"1","key":"24_CR32","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: SparsePOP\u2014A sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw. 35(2), 15:1\u201313 (2008)","DOI":"10.1145\/1377612.1377619"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0024-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0024-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0024-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T13:34:05Z","timestamp":1562679245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0024-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0024-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,9]]}}}