{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:27:55Z","timestamp":1770420475319,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T00:00:00Z","timestamp":1664409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T00:00:00Z","timestamp":1664409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006280","name":"Ministerio de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["MTM2014-60191-JIN"],"award-info":[{"award-number":["MTM2014-60191-JIN"]}],"id":[{"id":"10.13039\/501100006280","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","doi-asserted-by":"publisher","award":["FPU 17\/02643"],"award-info":[{"award-number":["FPU 17\/02643"]}],"id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["Post-doctoral contract 2019-2022"],"award-info":[{"award-number":["Post-doctoral contract 2019-2022"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["MTM2017-87197-C3"],"award-info":[{"award-number":["MTM2017-87197-C3"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we introduce , a global optimization solver specifically designed for (continuous) polynomial programming problems with box-constrained variables. Written entirely in ,  is based on the Reformulation-Linearization (Sherali and Tuncbilek in J Glob Optim 103:225\u2013249, 1992). We present a description of the main characteristics of  along with a thorough analysis of the impact on its performance of various enhancements discussed in the literature, such as bound tightening and SDP cuts. We also present a comparative study with three of the main state-of-the-art global optimization solvers: ,  and .\n<\/jats:p>","DOI":"10.1007\/s10898-022-01229-w","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T02:02:29Z","timestamp":1664416949000},"page":"541-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Computational advances in polynomial optimization: RAPOSa, a freely available global solver"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5276-2320","authenticated-orcid":false,"given":"Brais","family":"Gonz\u00e1lez-Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Joaqu\u00edn","family":"Ossorio-Castillo","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Gonz\u00e1lez-D\u00edaz","sequence":"additional","affiliation":[]},{"given":"\u00c1ngel M.","family":"Gonz\u00e1lez-Rueda","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Penas","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Rodr\u00edguez-Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"1229_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"1229_CR2","unstructured":"De\u00a0Backer, B., Didier, F., Gu\u00e9re, E.: Glop: an open-source linear programming solver. In: 22nd International Symposium on Mathematical Programming (2015)"},{"key":"1229_CR3","unstructured":"Balcan, M.-F., Dick, T., Sandholm, T., Vitercik, E.: Learning to branch. In: Dy, J., Krause, A. (Eds.) Proceedings of the 35th International Conference on Machine Learning, Stockholmsm\u00e4ssan, Stockholm Sweden: PMLR, Volume 80 of Proceedings of Machine Learning Research, pp. 344\u2013353 (2018)"},{"key":"1229_CR4","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s10898-012-9848-9","volume":"56","author":"P Belotti","year":"2013","unstructured":"Belotti, P.: Bound reduction using pairs of linear inequalities. J. Glob. Optim. 56, 787\u2013819 (2013)","journal-title":"J. Glob. Optim."},{"key":"1229_CR5","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On the convergence of feasibility based bounds tightening (2012)"},{"key":"1229_CR6","doi-asserted-by":"publisher","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, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1229_CR7","volume-title":"lpsolve: Open Source (Mixed-Integer) Linear Programming System","author":"M Berkelaar","year":"2004","unstructured":"Berkelaar, M., Eikland, K., Notebaert, P., et al.: lpsolve: Open Source (Mixed-Integer) Linear Programming System, vol. 63. Eindhoven University of Technology, Eindhoven (2004)"},{"key":"1229_CR8","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: The SCIP Optimization Suite 8.0. Technical report, optimization online (2021)"},{"key":"1229_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"1229_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68928-5","volume-title":"Pyomo\u2014Optimization Modeling in Python","author":"ML Bynum","year":"2021","unstructured":"Bynum, M.L., Hackebeil, G.A., Hart, W.E., Laird, C.D., Nicholson, B., Siirola, J.D., Watson, J.-P., Woodruff, D.L.: Pyomo\u2014Optimization Modeling in Python. Springer, Cham (2021)"},{"key":"1229_CR11","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: an integrated package for nonlinear optimization (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"key":"1229_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M.P., More, J.J.: The NEOS server. IEEE J. Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"IEEE J. Comput. Sci. Eng."},{"key":"1229_CR13","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1007\/s10898-012-0024-z","volume":"57","author":"E Dalkiran","year":"2013","unstructured":"Dalkiran, E., Sherali, H.D.: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality. J. Glob. Optim. 57, 1147\u20131172 (2013)","journal-title":"J. Glob. Optim."},{"key":"1229_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s12532-016-0099-5","volume":"8","author":"E Dalkiran","year":"2016","unstructured":"Dalkiran, E., Sherali, H.D.: RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems. Math. Program. Comput. 8, 337\u2013375 (2016)","journal-title":"Math. Program. Comput."},{"key":"1229_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1229_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02591747","volume":"31","author":"A Drud","year":"1985","unstructured":"Drud, A.: CONOPT: a GRG code for large sparse dynamic nonlinear optimization problems. Math. Program. 31, 153\u2013191 (1985)","journal-title":"Math. Program."},{"key":"1229_CR17","unstructured":"Forrest, J.J., Vigerske, S., Ralphs, T., Hafer, L., Santos, H.G., Saltzman, M., Kristjansson, B., King, A.: Clp: Version 1.17.6, Zenodo (2020)"},{"key":"1229_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1287\/mnsc.36.5.519","volume":"36","author":"R Fourer","year":"1990","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: a mathematical programing language. Manag. Sci. 36, 519\u2013554 (1990)","journal-title":"Manag. Sci."},{"key":"1229_CR19","unstructured":"Gay, D.M.: Hooking your solver to AMPL. Technical report 97-4-06, Bell Laboratories (1997)"},{"key":"1229_CR20","unstructured":"Gay, D.M.: Writing. nl files. Technical report 2005-7907P, Sandia National Laboratories (2005)"},{"key":"1229_CR21","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10898-016-0450-4","volume":"67","author":"AM Gleixner","year":"2017","unstructured":"Gleixner, A.M., Berthold, T., M\u00fcller, B., Weltge, S.: Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67, 731\u2013757 (2017)","journal-title":"J. Glob. Optim."},{"key":"1229_CR22","first-page":"1","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. (TOMS) 43, 1\u20135 (2016)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"1229_CR23","unstructured":"Gurobi Optimization: Gurobi Optimizer Reference Manual (2022). http:\/\/www.gurobi.com"},{"key":"1229_CR24","unstructured":"Khalil, E.B., Bodic, P.L., Song, L., Nemhauser, G.L., Dilkina, B.: Learning to branch in mixed integer programming. In: Schuurmans, D., Wellman, M.P. (Eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12\u201317, 2016, Phoenix, Arizona, USA. AAAI Press, pp. 724\u2013731 (2016)"},{"key":"1229_CR25","doi-asserted-by":"crossref","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 207\u2013236 (2017)","DOI":"10.1007\/s11750-017-0451-6"},{"key":"1229_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret. Optim. 19, 79\u2013102 (2016)","journal-title":"Discret. Optim."},{"key":"1229_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01588950","volume":"14","author":"BA Murtagh","year":"1978","unstructured":"Murtagh, B.A., Saunders, M.A.: Large-scale linearly constrained optimization. Math. Program. 14, 41\u201372 (1978)","journal-title":"Math. Program."},{"key":"1229_CR28","unstructured":"Perron, L., Furnon, V.: OR-tools (2019). https:\/\/developers.google.com\/optimization\/"},{"key":"1229_CR29","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/s10601-016-9267-5","volume":"22","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Domain reduction techniques for global NLP and MINLP optimization. Constraints 22, 338\u2013376 (2017)","journal-title":"Constraints"},{"key":"1229_CR30","unstructured":"Sahinidis, N.V.: BARON 21.1.13: global optimization of mixed-integer nonlinear programs, user\u2019s manual (2017)"},{"key":"1229_CR31","doi-asserted-by":"publisher","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, 483\u2013506 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1229_CR32","doi-asserted-by":"publisher","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 programming problems. J. Glob. Optim. 52, 447\u2013469 (2012)","journal-title":"J. Glob. Optim."},{"key":"1229_CR33","first-page":"225","volume":"103","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. 103, 225\u2013249 (1992)","journal-title":"J. Glob. Optim."},{"key":"1229_CR34","doi-asserted-by":"publisher","first-page":"15","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, 15 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"1229_CR35","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01229-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01229-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01229-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T05:10:12Z","timestamp":1677301812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01229-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,29]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1229"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01229-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,29]]},"assertion":[{"value":"16 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2022","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Missing funding information text is added","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}