{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:31:25Z","timestamp":1770424285825,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2017-04185"],"award-info":[{"award-number":["2017-04185"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CITMAga","award":["ITMATI-R-7-JGD"],"award-info":[{"award-number":["ITMATI-R-7-JGD"]}]},{"name":"CITMAga","award":["ITMATI-R-7-JGD"],"award-info":[{"award-number":["ITMATI-R-7-JGD"]}]},{"name":"Spanish Ministry of Education","award":["FPU grant 17\/02643"],"award-info":[{"award-number":["FPU grant 17\/02643"]}]},{"DOI":"10.13039\/501100008425","name":"Conseller\u00eda de Cultura, Educaci\u00f3n e Ordenaci\u00f3n Universitaria, Xunta de Galicia","doi-asserted-by":"publisher","award":["ED431C-2021\/24"],"award-info":[{"award-number":["ED431C-2021\/24"]}],"id":[{"id":"10.13039\/501100008425","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10957-024-02558-4","type":"journal-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T04:08:30Z","timestamp":1735531710000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4695-200X","authenticated-orcid":false,"given":"Brais","family":"Gonz\u00e1lez-Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Ra\u00fal","family":"Alvite-Paz\u00f3","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Alvite-Paz\u00f3","sequence":"additional","affiliation":[]},{"given":"Bissan","family":"Ghaddar","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Gonz\u00e1lez-D\u00edaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,30]]},"reference":[{"key":"2558_CR1","doi-asserted-by":"publisher","unstructured":"Andersen, E.D., Andersen, K.D.: The Mosek interior point optimizer for linear programming: An implementation of the homogeneous algorithm. In: H.\u00a0Frenk, K.\u00a0Roos, T.\u00a0Terlaky, S.\u00a0Zhang (eds.) High Performance Optimization, Appl. Optim., vol.\u00a033, pp. 197\u2013232. Springer US, Boston, MA (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3216-0_8","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"2558_CR2","doi-asserted-by":"publisher","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, 471\u2013484 (2009). https:\/\/doi.org\/10.1007\/s10898-008-9372-0","journal-title":"J. Glob. Optim."},{"key":"2558_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87, 131\u2013152 (2000). https:\/\/doi.org\/10.1007\/s101079900106","journal-title":"Math. Program."},{"key":"2558_CR4","unstructured":"Baltean-Lugojan, R., Bonami, P., Misener, R., Tramontani, A.: Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks. https:\/\/optimization-online.org\/wp-content\/uploads\/2018\/11\/6943.pdf (2019)"},{"issue":"4\u20135","key":"2558_CR5","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. Method Softw. 24(4\u20135), 597\u2013634 (2009). https:\/\/doi.org\/10.1080\/10556780903087124","journal-title":"Optim. Method Softw."},{"issue":"2","key":"2558_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2558_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-018-0133-x","volume":"10","author":"P Bonami","year":"2018","unstructured":"Bonami, P., G\u00fcnl\u00fck, O., Linderoth, J.: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3), 333\u2013382 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0133-x","journal-title":"Math. Program. Comput."},{"issue":"2","key":"2558_CR8","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1137\/16M107428X","volume":"29","author":"P Bonami","year":"2019","unstructured":"Bonami, P., Lodi, A., Schweiger, J., Tramontani, A.: Solving quadratic programming by cutting planes. SIAM J. Optim. 29(2), 1076\u20131105 (2019). https:\/\/doi.org\/10.1137\/16M107428X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2558_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"1","key":"2558_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-012-0534-y","volume":"141","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141(1), 435\u2013452 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0534-y","journal-title":"Math. Program."},{"issue":"2","key":"2558_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259\u2013282 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0080-6","journal-title":"Math. Program."},{"issue":"1","key":"2558_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01367-2","volume":"181","author":"S Burer","year":"2020","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181(1), 1\u201317 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01367-2","journal-title":"Math. Program."},{"key":"2558_CR13","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-a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003). https:\/\/doi.org\/10.1287\/ijoc.15.1.114.15159","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2558_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.resconrec.2006.06.013","volume":"50","author":"PM Castro","year":"2007","unstructured":"Castro, P.M., Matos, H.A., Novais, A.Q.: An efficient heuristic procedure for the optimal design of wastewater treatment systems. Resour. Conserv. Recycl. 50(2), 158\u2013185 (2007). https:\/\/doi.org\/10.1016\/j.resconrec.2006.06.013","journal-title":"Resour. Conserv. Recycl."},{"key":"2558_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.compchemeng.2013.01.013","volume":"52","author":"PM Castro","year":"2013","unstructured":"Castro, P.M., Teles, J.P.: Comparison of global optimization algorithms for the design of water-using networks. Comput. Chem. Eng. 52, 249\u2013261 (2013). https:\/\/doi.org\/10.1016\/j.compchemeng.2013.01.013","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"2558_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10098-008-0172-5","volume":"11","author":"PM Castro","year":"2009","unstructured":"Castro, P.M., Teles, J.P., Novais, A.Q.: Linear program-based algorithm for the optimal design of wastewater treatment systems. Clean Technol. Environ. Policy 11(1), 83\u201393 (2009). https:\/\/doi.org\/10.1007\/s10098-008-0172-5","journal-title":"Clean Technol. Environ. Policy"},{"key":"2558_CR17","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 Comput. Sci. Eng. 5, 68\u201375 (1998). https:\/\/doi.org\/10.1109\/99.714603","journal-title":"IEEE Comput. Sci. Eng."},{"issue":"4","key":"2558_CR18","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(4), 1147\u20131172 (2013). https:\/\/doi.org\/10.1007\/s10898-012-0024-z","journal-title":"J. Glob. Optim."},{"key":"2558_CR19","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). https:\/\/doi.org\/10.1007\/s12532-016-0099-5","journal-title":"Math. Program. Comput."},{"key":"2558_CR20","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). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"1","key":"2558_CR21","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1080\/10556788.2017.1350675","volume":"34","author":"S Elloumi","year":"2019","unstructured":"Elloumi, S., Lambert, A.: Global solution of non-convex quadratically constrained quadratic programs. Optim. Method Softw. 34(1), 98\u2013114 (2019). https:\/\/doi.org\/10.1080\/10556788.2017.1350675","journal-title":"Optim. Method Softw."},{"key":"2558_CR22","unstructured":"FICO: FICO Xpress Optimization Suite (2024). Available at: https:\/\/www.fico.com\/en\/products\/fico-xpress-optimization"},{"key":"2558_CR23","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. Manage. Sci. 36, 519\u2013554 (1990). https:\/\/doi.org\/10.1287\/mnsc.36.5.519","journal-title":"Manage. Sci."},{"key":"2558_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"1","author":"F Furini","year":"2018","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N., Vigerske, S., Wiegele, A.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 1, 237\u2013265 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0147-4","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2558_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10479-008-0481-4","volume":"188","author":"B Ghaddar","year":"2011","unstructured":"Ghaddar, B., Anjos, M.F., Liers, F.: A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1), 155\u2013174 (2011). https:\/\/doi.org\/10.1007\/s10479-008-0481-4","journal-title":"Ann. Oper. Res."},{"key":"2558_CR26","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.0090","author":"B Ghaddar","year":"2023","unstructured":"Ghaddar, B., G\u00f3mez-Casares, I., Gonz\u00e1lez-D\u00edaz, J., Gonz\u00e1lez-Rodr\u00edguez, B., Pateiro-L\u00f3pez, B., Rodr\u00edguez-Ballesteros, S.: Learning for spatial branching: an algorithm selection approach. INFORMS J. Comput. (2023). https:\/\/doi.org\/10.1287\/ijoc.2022.0090","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"2558_CR27","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2018.10.035","volume":"274","author":"B Ghaddar","year":"2019","unstructured":"Ghaddar, B., Jabr, R.A.: Power transmission network expansion planning: a semidefinite programming branch-and-bound approach. Eur. J. Oper. Res. 274(3), 837\u2013844 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.10.035","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2558_CR28","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/100802190","volume":"21","author":"B Ghaddar","year":"2011","unstructured":"Ghaddar, B., Vera, J.C., Anjos, M.F.: Second-order cone relaxations for binary quadratic polynomial programs. SIAM J. Optim. 21(1), 391\u2013414 (2011). https:\/\/doi.org\/10.1137\/100802190","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2558_CR29","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10898-022-01229-w","volume":"85","author":"B Gonz\u00e1lez-Rodr\u00edguez","year":"2023","unstructured":"Gonz\u00e1lez-Rodr\u00edguez, B., Ossorio-Castillo, J., Gonz\u00e1lez-D\u00edaz, J., Gonz\u00e1lez-Rueda, \u00c1.M., Penas, D.R., Rodr\u00edguez-Mart\u00ednez, D.: Computational advances in polynomial optimization: RAPOSa, a freely available global solver. J. Glob. Optim. 85(3), 541\u2013568 (2023). https:\/\/doi.org\/10.1007\/s10898-022-01229-w","journal-title":"J. Glob. Optim."},{"key":"2558_CR30","unstructured":"Gurobi Optimization: Gurobi Optimizer Reference Manual (2024). Available at: http:\/\/www.gurobi.com"},{"issue":"3","key":"2558_CR31","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219\u2013260 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0026-8","journal-title":"Math. Program. Comput."},{"key":"2558_CR32","unstructured":"IBM Corp.: IBM ILOG CPLEX Optimization Studio. CPLEX User\u2019s Manual (2024). Available at: https:\/\/www.ibm.com\/es-es\/products\/ilog-cplex-optimization-studio"},{"key":"2558_CR33","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10957-016-1023-x","volume":"172","author":"V Jeyakumar","year":"2017","unstructured":"Jeyakumar, V., Li, G.: Exact conic programming relaxations for a class of convex polynomial cone programs. J. Optim. Theory Appl. 172, 156\u2013178 (2017). https:\/\/doi.org\/10.1007\/s10957-016-1023-x","journal-title":"J. Optim. Theory Appl."},{"key":"2558_CR34","doi-asserted-by":"publisher","unstructured":"Kannan, R., Nagarajan, H., Deka, D.: Strong partitioning and a machine learning approximation for accelerating the global optimization of nonconvex qcqps. arXiv preprint (2024). https:\/\/doi.org\/10.48550\/arXiv.2301.00306","DOI":"10.48550\/arXiv.2301.00306"},{"key":"2558_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2022.107909","volume":"165","author":"T Karia","year":"2022","unstructured":"Karia, T., Adjiman, C.S., Chachuat, B.: Assessment of a two-step approach for global optimization of mixed-integer polynomial programs using quadratic reformulation. Comput. Chem. Eng. 165, 107909 (2022). https:\/\/doi.org\/10.1016\/j.compchemeng.2022.107909","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"2558_CR36","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0138-5","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2558_CR37","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"MR K\u0131l\u0131n\u00e7","year":"2018","unstructured":"K\u0131l\u0131n\u00e7, M.R., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. Optim. Method Softw. 33(3), 540\u2013562 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1350178","journal-title":"Optim. Method Softw."},{"key":"2558_CR38","doi-asserted-by":"crossref","unstructured":"Krislock, N., Malick, J., Roupin, F.: Biqcrunch: A semidefinite branch-and-bound method for solving binary quadratic problems. ACM Trans. Math. Softw. 43, 1\u201323 (2017). https:\/\/doi.org\/10.1145\/3005345","DOI":"10.1145\/3005345"},{"issue":"3","key":"2558_CR39","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/S1052623400366802","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2558_CR40","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1109\/TWC.2020.3031920","volume":"20","author":"M Lee","year":"2020","unstructured":"Lee, M., Ma, N., Yu, G., Dai, H.: Accelerating generalized benders decomposition for wireless resource allocation. IEEE Trans. Wirel. Commun. 20(2), 1233\u20131247 (2020). https:\/\/doi.org\/10.1109\/TWC.2020.3031920","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"2558_CR41","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"issue":"3","key":"2558_CR42","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s12532-023-00239-3","volume":"15","author":"M Lubin","year":"2023","unstructured":"Lubin, M., Dowson, O., Garcia, J.D., Huchette, J., Legat, B., Vielma, J.P.: Jump 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput. 15(3), 581\u2013589 (2023)","journal-title":"Math. Program. Comput."},{"key":"2558_CR43","first-page":"983","volume":"7","author":"N Meinshausen","year":"2006","unstructured":"Meinshausen, N.: Quantile regression forests. J. Mach. Learn. Res. 7, 983\u2013999 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"2558_CR44","unstructured":"MOSEK ApS: Introducing the MOSEK Optimization Suite 10.2.1 (2024). https:\/\/docs.mosek.com\/latest\/intro\/index.html"},{"issue":"2","key":"2558_CR45","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0387-5","journal-title":"Math. Program."},{"key":"2558_CR46","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.1166","author":"V Piccialli","year":"2022","unstructured":"Piccialli, V., Sudoso, A.M., Wiegele, A.: SOS-SDP: an exact solver for minimum sum-of-squares clustering. INFORMS J. Comput. (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1166","journal-title":"INFORMS J. Comput."},{"key":"2558_CR47","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2021). https:\/\/www.R-project.org\/"},{"issue":"2","key":"2558_CR48","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2), 307\u2013335 (2010). https:\/\/doi.org\/10.1007\/s10107-008-0235-8","journal-title":"Math. Program."},{"key":"2558_CR49","unstructured":"Sahinidis, N.V.: BARON 21.1.13: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2017)"},{"issue":"2","key":"2558_CR50","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(2), 483\u2013506 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9425-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2558_CR51","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BF00121304","journal-title":"J. Glob. Optim."},{"key":"2558_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD 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). https:\/\/doi.org\/10.1007\/BF01100203","journal-title":"J. Glob. Optim."},{"issue":"5","key":"2558_CR53","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/BF01074929","volume":"23","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: An approach to obtaining global extremums in polynomial mathematical programming problems. Cybernetics 23(5), 695\u2013700 (1987). https:\/\/doi.org\/10.1007\/BF01074929","journal-title":"Cybernetics"},{"key":"2558_CR54","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.compchemeng.2012.02.018","volume":"40","author":"JP Teles","year":"2012","unstructured":"Teles, J.P., Castro, P.M., Matos, H.A.: Global optimization of water networks design using multiparametric disaggregation. Comput. Chem. Eng. 40, 132\u2013147 (2012). https:\/\/doi.org\/10.1016\/j.compchemeng.2012.02.018","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"2558_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v077.i01","volume":"77","author":"MN Wright","year":"2017","unstructured":"Wright, M.N., Ziegler, A.: ranger: A fast implementation of random forests for high dimensional data in C++ and R. J. Stat. Softw. 77(1), 1\u201317 (2017). https:\/\/doi.org\/10.18637\/jss.v077.i01","journal-title":"J. Stat. Softw."},{"key":"2558_CR56","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). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02558-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02558-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02558-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T06:36:43Z","timestamp":1737527803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02558-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,30]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2558"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02558-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,30]]},"assertion":[{"value":"11 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}