A nonconvex quadratic optimization approach to the maximum edge weight clique problem
From MaRDI portal
Publication:1756769
DOI10.1007/s10898-018-0630-5zbMath1417.90145OpenAlexW2789302726MaRDI QIDQ1756769
Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy I. Butenko
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0630-5
Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (7)
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound ⋮ Algorithms for the generalized independent set problem based on a quadratic optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Infra-chromatic bound for exact maximum clique search
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- An exact algorithm for the maximum clique problem
- Approximating the maximum vertex/edge weighted clique using local search
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Quadratic programming with one negative eigenvalue is NP-hard
- An extended formulation approach to the edge-weighted maximal clique problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- Evolution towards the maximum clique
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- A lower bound on the independence number of a graph
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A fast algorithm for the maximum clique problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Iterated tabu search for the maximum diversity problem
- A new trust region technique for the maximum weight clique problem
- Improvements to MCS algorithm for the maximum clique problem
- On a polynomial fractional formulation for independence number of a graph
- A review on algorithms for maximum clique problems
- Hybrid heuristics for the maximum diversity problem
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- A global optimization approach for solving the maximum clique problem
- Continuous Characterizations of the Maximum Clique Problem
- Some news about the independence number of a graph
- On Dominating Sets and Independent Sets of Graphs
- Reducibility among Combinatorial Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
- Experimental and Efficient Algorithms
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
This page was built for publication: A nonconvex quadratic optimization approach to the maximum edge weight clique problem
