{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:43:55Z","timestamp":1764377035902,"version":"3.46.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0300"],"award-info":[{"award-number":["FA9550-23-1-0300"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10589-025-00674-z","type":"journal-article","created":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T16:40:21Z","timestamp":1741624821000},"page":"923-949","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Regularized standard polynomial programming formulations for the maximum clique problem"],"prefix":"10.1007","volume":"92","author":[{"given":"Mykyta","family":"Makovenko","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6662-9552","authenticated-orcid":false,"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[]},{"given":"Miltiades","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"674_CR1","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"A Ahmadi","year":"2013","unstructured":"Ahmadi, A., Olshevsky, A., Parrilo, P., Tsitsiklis, J.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137, 453\u2013476 (2013)","journal-title":"Math. Program."},{"key":"674_CR2","unstructured":"ARKI Consulting & Development A\/S. CONOPT. http:\/\/www.conopt.com\/. Accessed February (2023)"},{"issue":"1","key":"674_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/21M1408658","volume":"4","author":"I Bomze","year":"2022","unstructured":"Bomze, I., Rinaldi, F., Zeffiro, D.: Fast cluster detection in networks by first-order optimization. SIAM J. Math. Data Sci. 4(1), 285\u2013305 (2022)","journal-title":"SIAM J. Math. Data Sci."},{"key":"674_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze, I.M.: Evolution towards the maximum clique. J. Global Optim. 10, 143\u2013164 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"674_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"IM Bomze","year":"1998","unstructured":"Bomze, I.M.: On standard quadratic optimization problems. J. Global Optim. 13(4), 369\u2013387 (1998)","journal-title":"J. Global Optim."},{"key":"674_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., De Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18, 301\u2013320 (2000)","journal-title":"J. Global Optim."},{"key":"674_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1287\/moor.2020.1057","volume":"46","author":"IM Bomze","year":"2021","unstructured":"Bomze, I.M., Kahr, M., Leitner, M.: Trust your data or not - StQP remains StQP: Community detection via robust standard quadratic optimization. Math. Oper. Res. 46, 301\u2013316 (2021)","journal-title":"Math. Oper. Res."},{"issue":"13","key":"674_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(01)00233-5","volume":"121","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: A new heuristic for the maximum clique problem. Discret. Appl. Math. 121(13), 27\u201349 (2002)","journal-title":"Discret. Appl. Math."},{"key":"674_CR9","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, 1076\u20131105 (2019)","journal-title":"SIAM J. Optim."},{"key":"674_CR10","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S Busygin","year":"2006","unstructured":"Busygin, S.: A new trust region technique for the maximum weight clique problem. Discret. Appl. Math. 154, 2080\u20132096 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"674_CR11","doi-asserted-by":"publisher","first-page":"2102","DOI":"10.1137\/21M1419775","volume":"32","author":"S Butenko","year":"2022","unstructured":"Butenko, S., Makovenko, M., Pardalos, M.: A hierarchy of standard polynomial programming formulations for the maximum clique problem. SIAM J. Optim. 32(3), 2102\u20132128 (2022)","journal-title":"SIAM J. Optim."},{"key":"674_CR12","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s10732-011-9174-2","volume":"19","author":"S Butenko","year":"2013","unstructured":"Butenko, S., Yezerska, O., Balasundaram, B.: Variable objective search. J. Heuristics 19, 697\u2013709 (2013)","journal-title":"J. Heuristics"},{"issue":"4","key":"674_CR13","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E De Klerk","year":"2002","unstructured":"De Klerk, E., Pasechnik, D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"674_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.socnet.2016.01.001","volume":"46","author":"Z Ertem","year":"2016","unstructured":"Ertem, Z., Veremyev, A., Butenko, S.: Detecting large cohesive subgroups with high clustering coefficients in social networks. Social Netw. 46, 1\u201310 (2016)","journal-title":"Social Netw."},{"key":"674_CR15","doi-asserted-by":"crossref","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M.: A continuous based heuristic for the maximum clique problem. In: Johnson, D.S., Trick, M.A. (eds). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, volume\u00a026 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 103\u2013124. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/07"},{"key":"674_CR16","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"674_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-020-01611-0","volume":"193","author":"YG G\u00f6kmen","year":"2022","unstructured":"G\u00f6kmen, Y.G., Y\u0131ld\u0131r\u0131m, E.A.: On standard quadratic programs with exact and inexact doubly nonnegative relaxations. Math. Program. 193, 365\u2013403 (2022)","journal-title":"Math. Program."},{"key":"674_CR18","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1287\/moor.2018.0954","volume":"44","author":"JT Hungerford","year":"2019","unstructured":"Hungerford, J.T., Rinaldi, F.: A general regularized continuous formulation for the maximum clique problem. Math. Oper. Res. 44, 1161\u20131173 (2019)","journal-title":"Math. Oper. Res."},{"key":"674_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: editors. Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, volume\u00a026 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"674_CR20","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/080729104","volume":"20","author":"C Ling","year":"2010","unstructured":"Ling, C., Nie, J., Qi, L., Ye, Y.: Biquadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J. Optim. 20, 1286\u20131310 (2010)","journal-title":"SIAM J. Optim."},{"key":"674_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/10556788.2017.1341504","volume":"34","author":"G Liuzzi","year":"2019","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V.: A new branch-and-bound algorithm for standard quadratic programming problems. Optim. Methods Softw. 34, 79\u201397 (2019)","journal-title":"Optim. Methods Softw."},{"key":"674_CR22","unstructured":"Makovenko, M., Butenko, S.: Regularized standard polynomial programming formulations for the maximum clique problem. In: T\u00f3th, B.G., Csendes, T. (eds). Proceedings of the XV Workshop on Global Optimization, HUGO 2022, pp. 137\u2013141 (2022)"},{"key":"674_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"3\u20134","key":"674_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Phillips, A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33(3\u20134), 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"674_CR25","first-page":"313","volume":"2","author":"M Pelillo","year":"1996","unstructured":"Pelillo, M.: Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Netw. 2, 313\u2013328 (1996)","journal-title":"J. Artif. Neural Netw."},{"key":"674_CR26","first-page":"411","volume":"2","author":"M Pelillo","year":"1996","unstructured":"Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Netw. 2, 411\u2013420 (1996)","journal-title":"J. Artif. Neural Netw."},{"key":"674_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-020-01572-4","volume":"196","author":"V Stozhkov","year":"2022","unstructured":"Stozhkov, V., Buchanan, A., Butenko, S., Boginski, V.: Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196, 279\u2013307 (2022)","journal-title":"Math. Program."},{"key":"674_CR28","volume-title":"Nonlinear Optimization: Complexity Issues","author":"SA Vavasis","year":"1991","unstructured":"Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press Inc, New York, NY, USA (1991)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00674-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00674-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00674-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T10:28:12Z","timestamp":1764325692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00674-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["674"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00674-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"28 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}