A continuous characterization of the maximum vertex-weighted clique in hypergraphs
type: Item
instance of: scholarly article
title: A continuous characterization of the maximum vertex-weighted clique in hypergraphs
zbMATH Open document ID: 1401.90199
author: Guoren Wang
author: Cheng Zhao
author: Qingsong Tang
author: Xiangde Zhang
published in: Journal of Combinatorial Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6872606
zbMATH Keywords: vertex-weighted hypergraphs
zbMATH Keywords: cliques of hypergraphs
zbMATH Keywords: polynomial optimization
describes a project that uses: QUALEX
MaRDI profile type: Publication
full work available at URL: s10878-018-0259-9
OpenAlex ID: W2788592764
cites work: Evolution towards the maximum clique
cites work: Exact bounds on the order of the maximum clique of a graph.
cites work: A global optimization approach for solving the maximum clique problem
cites work: A generalization of the Motzkin-Straus theorem to hypergraphs
cites work: A Continuous-Based Approach for Partial Clique Enumeration
cites work: A new trust region technique for the maximum weight clique problem
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: Global optimization with polynomials and the problem of moments
cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex
cites work: Stable sets and polynomials
cites work: Linear and nonlinear programming.
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
Wikidata QID: Q130195798
DOI: 10.1007/S10878-018-0259-9
description: scientific article; zbMATH DE number 6872606