Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Solving the maximum clique problem using a tabu search approach
Annals of Operations Research - Special issue on Tabu search
A simple heuristic based genetic algorithm for the maximum clique problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
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
A Hybrid Genetic Algorithm for the Maximum Clique Problem
Proceedings of the 6th International Conference on Genetic Algorithms
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A hybrid heuristic for the maximum clique problem
Journal of Heuristics
A new trust region technique for the maximum weight clique problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
Reactive and dynamic local search for max-clique: Engineering effective building blocks
Computers and Operations Research
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
An effective local search for the maximum clique problem
Information Processing Letters
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
A Branch and Cut solver for the maximum stable set problem
Journal of Combinatorial Optimization
Coloring large graphs based on independent set extraction
Computers and Operations Research
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
An evolutionary algorithm with guided mutation for the maximum clique problem
IEEE Transactions on Evolutionary Computation
An exact algorithm for the maximum clique problem
Operations Research Letters
| Hi-index | 0.00 |
Given an undirected graph G=(V,E) with vertex set V={1,驴,n} and edge set E驴V脳V. The maximum clique problem is to determine in G a clique (i.e., a complete subgraph) of maximum cardinality. This paper presents an effective algorithm for the maximum clique problem. The proposed multistart tabu search algorithm integrates a constrained neighborhood, a dynamic tabu tenure mechanism and a long term memory based restart strategy. Our proposed algorithm is evaluated on the whole set of 80 DIMACS challenge benchmarks and compared with five state-of-the-art algorithms. Computational results show that our proposed algorithm attains the largest known clique for 79 benchmarks.