Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
A neural network model for finding a near-maximum clique
Journal of Parallel and Distributed Computing - Special issue on neural computing on massively parallel processing
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Tabu Search
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A hybrid heuristic for the maximum clique problem
Journal of Heuristics
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
Journal of Global Optimization
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
An efficient branch-and-bound algorithm for finding a maximum clique
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem
ICTAI '10 Proceedings of the 2010 22nd IEEE International Conference on Tools with Artificial Intelligence - Volume 01
A simple and faster branch-and-bound algorithm for finding a maximum clique
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A new table of constant weight codes
IEEE Transactions on Information Theory
An exact algorithm for the maximum clique problem
Operations Research Letters
Fast local search for the maximum independent set problem
Journal of Heuristics
Hi-index | 0.00 |
In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (2010) and MAXSAT algorithm by Li and Quan (2010a, b). We suggest a general approach which allows us to speed up considerably these branch and bound algorithms on hard instances. The idea is to apply a powerful heuristic for obtaining an initial solution of high quality. This solution is then used to prune branches in the main branch and bound algorithm. For this purpose we apply ILS heuristic by Andrade et al. (J Heuristics 18(4):525---547, 2012). The best results are obtained for p_hat1000-3 instance and gen instances with up to 11,000 times speedup.