A simple simulated annealing algorithm for the maximum clique problem
heuristic algorithmmaximum clique problemNP-hard optimization problemminimum vertex cover problemSimulated annealing algorithm
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- A branch and bound algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- A new trust region technique for the maximum weight clique problem
- A simulated annealing algorithm for determining the thickness of a graph
- An effective local search for the maximum clique problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- Annealed replication: A new heuristic for the maximum clique problem
- Attacks of simple block ciphers via efficient heuristics
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combining GP operators with SA search to evolve fuzzy rule based classifiers
- Conjugate conflict continuation graphs for multi-layer constrained via minimization
- Finding a Maximum Clique in an Arbitrary Graph
- Modelling competitive Hopfield networks for the maximum clique problem
- Optimization by simulated annealing
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Variable neighborhood search for the maximum clique
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Corrigendum for "Truth in a logic of formal inconsistency: How classical can it get?"
- Some spin glass ideas applied to the clique problem
- Hybrid constrained evolutionary algorithm for numerical optimization problems
- scientific article; zbMATH DE number 1560332 (Why is no real title available?)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- Finding quasi core with simulated stacked neural networks
This page was built for publication: A simple simulated annealing algorithm for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456476)
