A simple simulated annealing algorithm for the maximum clique problem
DOI10.1016/J.INS.2007.06.009zbMATH Open1121.90412OpenAlexW2019853242MaRDI QIDQ2456476FDOQ2456476
Authors: Xiutang Geng, Jin Xu, Jianhua Xiao, Linqiang Pan 
Publication date: 18 October 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.06.009
Recommendations
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)
Cites Work
- Optimization by simulated annealing
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Title not available (Why is that?)
- A fast algorithm for the maximum clique problem
- Finding a Maximum Clique in an Arbitrary Graph
- A new trust region technique for the maximum weight clique problem
- A branch and bound algorithm for the maximum clique problem
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An effective local search for the maximum clique problem
- Annealed replication: A new heuristic for the maximum clique problem
- Variable neighborhood search for the maximum clique
- Combining GP operators with SA search to evolve fuzzy rule based classifiers
- Conjugate conflict continuation graphs for multi-layer constrained via minimization
- A simulated annealing algorithm for determining the thickness of a graph
- Attacks of simple block ciphers via efficient heuristics
- Modelling competitive Hopfield networks for the maximum clique problem
Cited In (7)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
- Title not available (Why is that?)
- Some spin glass ideas applied to the clique problem
- Corrigendum for "Truth in a logic of formal inconsistency: How classical can it get?"
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Title not available (Why is that?)
- Finding quasi core with simulated stacked neural networks
Uses Software
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)
