{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:09:53Z","timestamp":1770415793369,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T00:00:00Z","timestamp":1454457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s12532-016-0099-5","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T13:03:52Z","timestamp":1454504632000},"page":"337-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Evrim","family":"Dalkiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,3]]},"reference":[{"key":"99_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha $$ \u03b1 BB: a global optimization method for general constrained nonconvex problems. J. Global Optim. 7, 337\u2013363 (1995)","journal-title":"J. Global Optim."},{"issue":"2\u20133","key":"99_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. Global Optim. 43(2\u20133), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"issue":"2","key":"99_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233\u2013251 (2012)","journal-title":"Math. Program."},{"key":"99_CR4","doi-asserted-by":"crossref","unstructured":"Balas, E., Ceria, S., Cornuejols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework (1996)","DOI":"10.1287\/mnsc.42.9.1229"},{"key":"99_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, New York (2006)","edition":"3"},{"issue":"4\u20135","key":"99_CR6","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":"99_CR7","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":"4","key":"99_CR8","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1007\/s10898-012-0024-z","volume":"57","author":"E Dalkiran","year":"2013","unstructured":"Dalkiran, E., Sherali, H.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. J. Global Optim. 57(4), 1147\u20131172 (2013)","journal-title":"J. Global Optim."},{"issue":"1","key":"99_CR9","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":"99_CR10","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-Verlag, Berlin Heidelberg, New York (1981)"},{"key":"99_CR11","unstructured":"Ibm, ILOG CPLEX Optimization Studio. http:\/\/www.ilog.com\/products\/cplex"},{"issue":"2","key":"99_CR12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: Semidefinite programming vs. LP relaxations for polynomial programming. Math. Operations Res. 27(2), 347\u2013360 (2002)","journal-title":"Math. Operations Res."},{"issue":"3","key":"99_CR13","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."},{"key":"99_CR14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Handbook on Discrete Optimization","author":"M Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite Programming and Integer Programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"99_CR15","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. Global Optim. 33, 157\u2013196 (2005)","journal-title":"J. Global Optim."},{"key":"99_CR16","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. Global Optim. 36, 161\u2013189 (2006)","journal-title":"J. Global Optim."},{"key":"99_CR17","unstructured":"MATLAB: version 7.12.0 (R2011a). The MathWorks Inc., Natick, Massachusetts (2011)"},{"issue":"2","key":"99_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Global Optim."},{"key":"99_CR19","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":"6","key":"99_CR20","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.dam.2008.03.041","volume":"157","author":"HD Sherali","year":"2009","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0\u20131 and general discrete restrictions. Discrete Appl. Math. 157(6), 1319\u20131333 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"99_CR21","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. Global Optim. 51(3), 377\u2013393 (2011)","journal-title":"J. Global Optim."},{"issue":"2","key":"99_CR22","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$$ v -semidefinite cuts. Comput. Optim. Appl. 52(2), 483\u2013506 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"99_CR23","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. Global Optim. 52(3), 447\u2013469 (2012)","journal-title":"J. Global Optim."},{"issue":"1\u20134","key":"99_CR24","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. Global Optim. 22(1\u20134), 233\u2013261 (2002)","journal-title":"J. Global Optim."},{"issue":"1","key":"99_CR25","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. Global Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Global Optim."},{"issue":"1","key":"99_CR26","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. Operations Res. Lett. 21(1), 1\u20139 (1997)","journal-title":"Operations Res. Lett."},{"issue":"3","key":"99_CR27","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."},{"issue":"1\u20134","key":"99_CR28","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optimiz. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optimiz. Methods Softw."},{"issue":"2","key":"99_CR29","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(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"99_CR30","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."},{"issue":"2","key":"99_CR31","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/1377612.1377619","volume":"35","author":"H Waki","year":"2008","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\u201315:13 (2008)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2\u20133","key":"99_CR32","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s10898-014-0190-2","volume":"59","author":"K Zorn","year":"2014","unstructured":"Zorn, K., Sahinidis, N.V.: Global optimization of general nonconvex problems with intermediate polynomial structures. J. Global Optim. 59(2\u20133), 673\u2013693 (2014)","journal-title":"J. Global Optim."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0099-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-016-0099-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0099-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T07:17:25Z","timestamp":1567581445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-016-0099-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,3]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["99"],"URL":"https:\/\/doi.org\/10.1007\/s12532-016-0099-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,3]]}}}