A nonconvex quadratic optimization approach to the maximum edge weight clique problem
From MaRDI portal
Publication:1756769
Recommendations
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Continuous Characterizations of the Maximum Clique Problem
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
Cites work
- A cutting-plane approach to the edge-weighted maximal clique problem
- A fast algorithm for the maximum clique problem
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A global optimization approach for solving the maximum clique problem
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A Lagrangian relaxation approach to the edge-weighted clique problem
- A lower bound on the independence number of a graph
- A new trust region technique for the maximum weight clique problem
- A review on algorithms for maximum clique problems
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An extended formulation approach to the edge-weighted maximal clique problem
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Approximating the maximum vertex/edge weighted clique using local search
- Continuous Characterizations of the Maximum Clique Problem
- Evolution towards the maximum clique
- Experimental and Efficient Algorithms
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- scientific article; zbMATH DE number 1560332 (Why is no real title available?)
- scientific article; zbMATH DE number 956845 (Why is no real title available?)
- Hybrid heuristics for the maximum diversity problem
- Improvements to MCS algorithm for the maximum clique problem
- Infra-chromatic bound for exact maximum clique search
- Iterated tabu search for the maximum diversity problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- On a polynomial fractional formulation for independence number of a graph
- On Dominating Sets and Independent Sets of Graphs
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
- Quadratic programming with one negative eigenvalue is NP-hard
- Reducibility among combinatorial problems
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Some news about the independence number of a graph
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
Cited in
(16)- A continuous characterization of the maximum vertex-weighted clique in hypergraphs
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- On a continuous approach for the maximum weighted clique problem
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- Continuous Characterizations of the Maximum Clique Problem
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Common object discovery as local search for maximum weight cliques in a global object similarity graph
- Problems on cliques and non-convex optimization
- A Lagrangian relaxation approach to the edge-weighted clique problem
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
This page was built for publication: A nonconvex quadratic optimization approach to the maximum edge weight clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756769)
