A new trust region technique for the maximum weight clique problem
From MaRDI portal
Publication:2433799
DOI10.1016/j.dam.2005.04.010zbMath1111.90020OpenAlexW2117713290MaRDI QIDQ2433799
Publication date: 30 October 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.010
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Subgraph extraction and metaheuristics for the maximum clique problem, Maximum cliques of hypergraphs and polynomial optimization, Phased local search for the maximum clique problem, A review on algorithms for maximum clique problems, A linear-time algorithm for trust region problems, Solving the maximum vertex weight clique problem via binary quadratic programming, A Motzkin-Straus type result for 3-uniform hypergraphs, On a continuous approach for the maximum weighted clique problem, An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network, Unnamed Item, Permutation codes with specified packing radius, An adaptive multistart tabu search approach to solve the maximum clique problem, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, The stable set problem: clique and nodal inequalities revisited, On Motzkin-Straus type results for non-uniform hypergraphs, A Max-SAT Inference-Based Pre-processing for Max-Clique, Maximum-weight stable sets and safe lower bounds for graph coloring, On graph-Lagrangians of hypergraphs containing dense subgraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges, A simple simulated annealing algorithm for the maximum clique problem, Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices, On Lagrangians of \(r\)-uniform hypergraphs, A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs, A continuous characterization of the maximum vertex-weighted clique in hypergraphs, PUSH: A generalized operator for the maximum vertex weight clique problem, Approximate Dynamic Programming based on High Dimensional Model Representation, Finding quasi core with simulated stacked neural networks, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, A tutorial on branch and cut algorithms for the maximum stable set problem, Multi-neighborhood tabu search for the maximum weight clique problem, A hybrid heuristic for the maximum clique problem, An exact bit-parallel algorithm for the maximum clique problem, Some Motzkin-Straus type results for non-uniform hypergraphs, Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, A generalization of the Motzkin-Straus theorem to hypergraphs, 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local minima of the trust region problem
- Maximum stable set formulations and heuristics based on continuous optimization
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- An augmentation algorithm for the maximum weighted stable set problem
- Minimizing a Quadratic Over a Sphere
- A Complementary Pivoting Approach to the Maximum Weight Clique Problem
- The complexity of the matrix eigenproblem
- Computing a Trust Region Step
- Continuous Characterizations of the Maximum Clique Problem
- 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
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
