Cited in
(65)- Approximate dynamic programming based on high dimensional model representation
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- scientific article; zbMATH DE number 5669599 (Why is no real title available?)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- 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
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Using constraint programming to solve the maximum clique problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Multi-neighborhood tabu search for the maximum weight clique problem
- A generalization of the Motzkin-Straus theorem to hypergraphs
- PUSH: A generalized operator for the maximum vertex weight clique problem
- Phased local search for the maximum clique problem
- Exact solution of graph coloring problems via constraint programming and column generation
- A tutorial on branch and cut algorithms for the maximum stable set problem
- On the maxima of Motzkin-Straus programs and cliques of graphs
- gpuls-mwcp
- On cliques and Lagrangians of hypergraphs
- On a continuous approach for the maximum weighted clique problem
- On a polynomial fractional formulation for independence number of a graph
- Subgraph extraction and metaheuristics for the maximum clique problem
- Maximum cliques of hypergraphs and polynomial optimization
- Permutation codes with specified packing radius
- On solving trust-region and other regularised subproblems in optimization
- Novel approaches for analyzing biological networks
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- Solving maximum clique problem for protein structure similarity
- A simple simulated annealing algorithm for the maximum clique problem
- Max-AO
- EXTRACOL
- G23FM
- BHOSLIB
- DIMACS
- NuMVC
- FASoft
- MaxCliqueDyn
- H-Morph
- Algorithm 787
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- A linear-time algorithm for trust region problems
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
- Sublinear-time quadratic minimization via spectral decomposition of matrices
- The stable set problem: clique and nodal inequalities revisited
- Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
- A new trust region technique for the maximum weight clique problem
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs
- A novel evolutionary formulation of the maximum independent set problem
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- Finding quasi core with simulated stacked neural networks
- Continuous cubic formulations for cluster detection problems in networks
- On Lagrangians of \(r\)-uniform hypergraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A hybrid heuristic for the maximum clique problem
- A Motzkin-Straus type result for 3-uniform hypergraphs
- On Motzkin-Straus type results for non-uniform hypergraphs
- A review on algorithms for maximum clique problems
This page was built for software: QUALEX
