A continuous characterization of the maximum vertex-weighted clique in hypergraphs

DOI10.1007/s10878-018-0259-9zbMath1401.90199OpenAlexW2788592764WikidataQ130195798 ScholiaQ130195798MaRDI QIDQ1752628

Guoren Wang, Cheng Zhao, Xiang-De Zhang, Qing-song Tang

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0259-9

zbMATH Keywords

polynomial optimizationcliques of hypergraphsvertex-weighted hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27)

Uses Software

• QUALEX

Cites Work

• Linear and nonlinear programming.
• A generalization of the Motzkin-Straus theorem to hypergraphs
• Stable sets and polynomials
• Evolution towards the maximum clique
• Exact bounds on the order of the maximum clique of a graph.
• A new trust region technique for the maximum weight clique problem
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• Global Optimization with Polynomials and the Problem of Moments
• A global optimization approach for solving the maximum clique problem
• Continuous Characterizations of the Maximum Clique Problem
• A Continuous-Based Approach for Partial Clique Enumeration
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: A continuous characterization of the maximum vertex-weighted clique in hypergraphs