A General Regularized Continuous Formulation for the Maximum Clique Problem
From MaRDI portal
Publication:5108235
DOI10.1287/moor.2018.0954zbMath1437.90147arXiv1709.02486OpenAlexW2963121468WikidataQ128196211 ScholiaQ128196211MaRDI QIDQ5108235
James T. Hungerford, Francesco Rinaldi
Publication date: 30 April 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.02486
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items (6)
Fast Cluster Detection in Networks by First Order Optimization ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Uses Software
Cites Work
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Checking local optimality in constrained quadratic programming is NP- hard
- Parsimonious least norm approximation
- Evolution towards the maximum clique
- Annealed replication: A new heuristic for the maximum clique problem
- On solving the maximum clique problem
- Optimality conditions for maximizing a function over a polyhedron
- A review on algorithms for maximum clique problems
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Some NP-complete problems in quadratic and nonlinear programming
- A global optimization approach for solving the maximum clique problem
- Continuous Characterizations of the Maximum Clique Problem
- Reducibility among Combinatorial Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A General Regularized Continuous Formulation for the Maximum Clique Problem
