{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:21:37Z","timestamp":1649002897417},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T00:00:00Z","timestamp":1411776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10878-014-9798-x","type":"journal-article","created":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T06:12:12Z","timestamp":1411711932000},"page":"881-892","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Yanming","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,27]]},"reference":[{"key":"9798_CR1","doi-asserted-by":"crossref","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":"9798_CR2","doi-asserted-by":"crossref","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":"9798_CR3","doi-asserted-by":"crossref","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":"9798_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","volume":"52","author":"P Frankl","year":"1989","unstructured":"Frankl P, F\u00fcredi Z (1989) Extremal problems whose solutions are the blow-ups of the small Witt-designs. J Comb Theory (A) 52:129\u2013147","journal-title":"J Comb Theory (A)"},{"key":"9798_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P Frankl","year":"1984","unstructured":"Frankl P, R\u00f6dl V (1984) Hypergraphs do not jump. Combinatorica 4:149\u2013159","journal-title":"Combinatorica"},{"key":"9798_CR6","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","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 22:754\u2013768","journal-title":"Math Oper Res"},{"key":"9798_CR7","unstructured":"Johston T, Lu L Tur\u00e1n problems on non-uniform hypergraphs, submitted"},{"key":"9798_CR8","first-page":"228","volume":"15","author":"G Katona","year":"1964","unstructured":"Katona G, Nemetz T, Simonovits M (1964) On a graph problem of Tur\u00e1n. Mat Lapok 15:228\u2013238","journal-title":"Mat Lapok"},{"key":"9798_CR9","unstructured":"Keevash P (2011) Surveys in combinatorics. Cambridge University Press, Cambridge, pp 83\u2013140"},{"key":"9798_CR10","unstructured":"Luenberger DG (1984) Linear and nonlinear programming. Addison Wesley, Reading"},{"key":"9798_CR11","doi-asserted-by":"crossref","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":"9798_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Phillips AT (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":"9798_CR13","unstructured":"Peng Y, Peng H, Tang Q, Zhao C An extension of Motzkin\u2013Straus theorem to non-uniform hypergraphs and its applications, preprint"},{"key":"9798_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S Rota Bul\u00f2","year":"2009","unstructured":"Rota Bul\u00f2 S, Pelillo M (2009) A generalization of the Motzkin\u2013Straus theorem to hypergraph. Optim Lett 3:287\u2013295","journal-title":"Optim Lett"},{"key":"9798_CR15","doi-asserted-by":"crossref","unstructured":"Sidorenko AF (1987) The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs. Math Notes 41: 247\u2013259. Translated from Mat Zametki","DOI":"10.1007\/BF01158259"},{"key":"9798_CR16","first-page":"433","volume":"41","author":"AF Sidorenko","year":"1987","unstructured":"Sidorenko AF (1987) Solution of a problem of Bollobas on 4-graphs. Mat Zametki 41:433\u2013455","journal-title":"Mat Zametki"},{"key":"9798_CR17","first-page":"189","volume":"63","author":"V S\u00f3s","year":"1982","unstructured":"S\u00f3s V, Straus EG (1982) Extremal of functions on graphs with applications to graphs and hypergraphs. J Comb Theory Ser B 63:189\u2013207","journal-title":"J Comb Theory Ser B"},{"key":"9798_CR18","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) On an extremal problem in graph theory (in Hungarian). Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9798-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9798-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9798-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:24Z","timestamp":1559276604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9798-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,27]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9798"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9798-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,27]]}}}