{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:36Z","timestamp":1740122376001,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T00:00:00Z","timestamp":1519430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005236","name":"Chinese Universities Scientific Fund","doi-asserted-by":"publisher","award":["N140504004"],"award-info":[{"award-number":["N140504004"]}],"id":[{"id":"10.13039\/501100005236","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010018","name":"Doctoral Starting up Foundation of Liaoning Province","doi-asserted-by":"crossref","award":["201601011"],"award-info":[{"award-number":["201601011"]}],"id":[{"id":"10.13039\/501100010018","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10878-018-0259-9","type":"journal-article","created":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T10:13:35Z","timestamp":1519467215000},"page":"1250-1260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A continuous characterization of the maximum vertex-weighted clique in hypergraphs"],"prefix":"10.1007","volume":"35","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":"Guoren","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,24]]},"reference":[{"key":"259_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze IM (1997) Evolution towards the maximum clique. J Glob Optim 10:143\u2013164","journal-title":"J Glob Optim"},{"key":"259_CR2","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 (2003) Exact bounds on the order of the maximum clique of a graph. Discrete Appl Math 127:535\u2013543","journal-title":"Discrete Appl Math"},{"key":"259_CR3","unstructured":"Bul\u00f2 SR, Pelillo M (2008) A continuous characterization of maximal cliques in $$k$$ k -uniform hypergraphs. In: Learning and intelligent optimization (lecture notes in computer science), vol 5315, pp 220\u2013233"},{"key":"259_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"SR Bul\u00f2","year":"2009","unstructured":"Bul\u00f2 SR, Pelillo M (2009) A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim Lett 3:287\u2013295","journal-title":"Optim Lett"},{"key":"259_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-72903-7_6","volume":"4538","author":"SR Bul\u00f2","year":"2007","unstructured":"Bul\u00f2 SR, Torsello A, Pelillo M (2007) A continuous-based approach for partial clique enumeration. Graph Based Represent Pattern Recognit 4538:61\u201370","journal-title":"Graph Based Represent Pattern Recognit"},{"key":"259_CR6","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 (2006) A new trust region technique for the maximum weight clique problem. Discrete Appl Math 154:2080\u20132096","journal-title":"Discrete Appl Math"},{"key":"259_CR7","doi-asserted-by":"crossref","unstructured":"Dong C, Zhou Q, Cai Y, Hong X (2008) Hypergraph partitioning satisfying dual constraints on vertex and edge weight. In: 51st Midwest symposium on circuits and systems, 2008. MWSCAS 2008. IEEE, pp 85\u201388","DOI":"10.1109\/MWSCAS.2008.4616742"},{"key":"259_CR8","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"122","author":"LE Gibbons","year":"1997","unstructured":"Gibbons LE, Hearn DW, Pardalos PM, Ramana MV (1997) Continuous characterizations of the maximum clique problem. Math Oper Res 122:754\u2013768","journal-title":"Math Oper Res"},{"key":"259_CR9","first-page":"796","volume":"3","author":"B Jean","year":"2001","unstructured":"Jean B, Lasserre (2001) Global optimization with polynimal and the problem of moments. SLAM J Optim 3:796\u2013817","journal-title":"SLAM J Optim"},{"key":"259_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"ED Klerk","year":"2006","unstructured":"Klerk ED, Laurent M, Parrilo PA (2006) A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor Comput Sci 361:210\u2013225","journal-title":"Theor Comput Sci"},{"key":"259_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","volume":"124","author":"L Lovasz","year":"1994","unstructured":"Lovasz L (1994) Stable sets and polynomials. Discrete Math 124:137\u2013153","journal-title":"Discrete Math"},{"key":"259_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"2008","unstructured":"Luenberger DG, Ye Y (2008) Linear and nonlinear programming, 3rd edn. Springer, LLC, Reading","edition":"3"},{"key":"259_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can J Math 17:533\u2013540","journal-title":"Can J Math"},{"key":"259_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Phillips A (1990) A global optimization approach for solving the maximum clique problem. Int J Comput Math 33:209\u2013216","journal-title":"Int J Comput Math"},{"key":"259_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 (2007) Dominant sets and pairwise clustering. IEEE Trans Pattern Anal Mach 29:167\u2013172","journal-title":"IEEE Trans Pattern Anal Mach"},{"key":"259_CR16","doi-asserted-by":"crossref","unstructured":"Su L, Gao Y, Zhao X, Wan H, Gu M, Sun J (2017) Vertex-weighted hypergraph learning for multi-view object classification. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI-17), pp 2779\u20132785","DOI":"10.24963\/ijcai.2017\/387"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0259-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0259-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0259-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T16:13:35Z","timestamp":1570810415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0259-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,24]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0259-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,2,24]]},"assertion":[{"value":"24 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}