{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:47Z","timestamp":1740122447012,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005236","name":"Chinese Universities Scientific Fund","doi-asserted-by":"publisher","award":["N180504008"],"award-info":[{"award-number":["N180504008"]}],"id":[{"id":"10.13039\/501100005236","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":[[2022,12]]},"DOI":"10.1007\/s10898-022-01187-3","type":"journal-article","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T03:28:22Z","timestamp":1653708502000},"page":"989-1003","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the maxima of motzkin-straus programs and cliques of graphs"],"prefix":"10.1007","volume":"84","author":[{"given":"Qingsong","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangde","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"1187_CR1","first-page":"808","volume":"102","author":"M Aigner","year":"1995","unstructured":"Aigner, M.: Tur\u00e1n\u2019s graph theorem. Amer. Math. Monthly 102, 808\u2013816 (1995)","journal-title":"Amer. Math. Monthly"},{"key":"1187_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory. Springer-Verlag, New York (1998)"},{"issue":"2","key":"1187_CR3","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 Optimiz. 10(2), 143\u2013164 (1997)","journal-title":"J. Global Optimiz."},{"key":"1187_CR4","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0166-218X(02)00386-4","volume":"127","author":"M Budinich","year":"2003","unstructured":"Budinich, M.: Exact bounds on the order of the maximum clique of a graph. Discret. Appl. Math. 127, 535\u2013543 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1187_CR5","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"304","author":"S Busygin","year":"2006","unstructured":"Busygin, S.: A new trust region technique for the maximum weight clique problem. Discret. Appl. Math. 304(4), 2080\u20132096 (2006)","journal-title":"Discret. Appl. Math."},{"key":"1187_CR6","volume-title":"Graph theory","author":"R Diestel","year":"1997","unstructured":"Diestel, R.: Graph theory, 3rd edn. Springer-Verlag, New York (1997)","edition":"3"},{"key":"1187_CR7","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":"1187_CR8","first-page":"476","volume-title":"Graph theory and its applications","author":"JT Gross","year":"2006","unstructured":"Gross, J.T., Yellen, J.: Graph theory and its applications, 2nd edn., pp. 476\u2013477. CRC Press, Boca Raton (2006)","edition":"2"},{"issue":"4","key":"1187_CR9","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1287\/moor.2018.0954","volume":"44","author":"JT Hungerford","year":"2017","unstructured":"Hungerford, J.T., Rinaldi, F.: A general regularized continuous formulation for the maximum clique problem. Math. Oper. Res. 44(4), 1161\u20131173 (2017)","journal-title":"Math. Oper. Res."},{"key":"1187_CR10","unstructured":"Liu, H., Latecki, J., Yan, S.: Robust clustering as ensembles of affinity relations. In: Advances in Neural Information Processing Systems, pp. 1414-1422 (2010)"},{"key":"1187_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and nonlinear programming","author":"D Luenberger","year":"2008","unstructured":"Luenberger, D., Ye, Y.: Linear and nonlinear programming, 3rd edn. Springer Science Business Media, LLC, Reading (2008)","edition":"3"},{"key":"1187_CR12","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. Canad. J. Math. 17, 533\u2013540 (1965)","journal-title":"Canad. J. Math."},{"key":"1187_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-540-45063-4_31","volume":"2683","author":"M Pavan","year":"2003","unstructured":"Pavan, M., Pelillo, M.: Generalizing the Motzkin-Straus theorem to edge-weighted graphs, with applications to image segmentation. Lect. Notes Comput. Sci. 2683, 485\u2013500 (2003)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1187_CR14","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, 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"1187_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","volume":"29","author":"M Pavan","year":"2007","unstructured":"Pavan, M., Pelillo, M.: Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell. 29, 167\u2013172 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"1187_CR16","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11(8), 1933\u20131955 (1999)","journal-title":"Neural Comput."},{"issue":"11","key":"1187_CR17","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1109\/TPAMI.2002.1046176","volume":"24","author":"M Pelillo","year":"2002","unstructured":"Pelillo, M.: Matching free trees, maximal cliques, and monotone game dynamics. Pattern Anal. Mach. Intell. 24(11), 1535\u20131541 (2002)","journal-title":"Pattern Anal. Mach. Intell."},{"key":"1187_CR18","first-page":"411","volume":"4","author":"M Pelillo","year":"1995","unstructured":"Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. Artif. Neural Networks 4, 411\u2013420 (1995)","journal-title":"Artif. Neural Networks"},{"issue":"11","key":"1187_CR19","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell. 21(11), 1105\u20131120 (1999)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1187_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139164849","volume-title":"Computational discrete mathematics: combinatorics and graph theory in mathematica","author":"S Pemmaraju","year":"2003","unstructured":"Pemmaraju, S., Skiena, S.: Computational discrete mathematics: combinatorics and graph theory in mathematica. Cambridge University Press, Cambridge (2003)"},{"key":"1187_CR21","volume-title":"Graph theory","author":"D Reinhard","year":"2000","unstructured":"Reinhard, D.: Graph theory. Springer-Verlag, New York (2000)"},{"key":"1187_CR22","doi-asserted-by":"crossref","unstructured":"Rota Bul\u00f3, S.: A continuous characterization of maximal cliques in $$k$$-uniform hypergraphs. In: Learning and Intellig. Optim. (Lecture Notes in Computer Science), 5313, 220\u2013233 (2008)","DOI":"10.1007\/978-3-540-92695-5_17"},{"key":"1187_CR23","first-page":"61","volume":"4538","author":"S Rota Bul\u00f3","year":"2007","unstructured":"Rota Bul\u00f3, S., Torsello, A., Pelillo, M.: A continuous-based approach for partial clique enumeration. Graph-Based Represent. Patt. Recogn. 4538, 61\u201370 (2007)","journal-title":"Graph-Based Represent. Patt. Recogn."},{"key":"1187_CR24","volume-title":"Implementing discrete mathematics: combinatorics and graph theory with mathematica","author":"S Skiena","year":"1991","unstructured":"Skiena, S.: Implementing discrete mathematics: combinatorics and graph theory with mathematica. Addison-Wesley, Reading (1991)"},{"key":"1187_CR25","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory(in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01187-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01187-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01187-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T06:14:07Z","timestamp":1666246447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01187-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,28]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1187"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01187-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,5,28]]},"assertion":[{"value":"16 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}