Local optimization and the traveling salesman problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
On maximum clique problems in very large graphs
External memory algorithms
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Journal of Heuristics
Annealed replication: a new heuristic for the maximum clique problem
Discrete Applied Mathematics
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 fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
Searching for maximum cliques with ant colony optimization
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
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 leader-based parallel cross entropy algorithm for MCP
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
Hi-index | 0.89 |
We propose a variable depth search based algorithm, called k-opt local search (KLS), for the maximum clique problem. KLS efficiently explores the k-opt neighborhood defined as the set of neighbors that can be obtained by a sequence of several add and drop moves that are adaptively changed in the feasible search space. Computational results on DIMACS benchmark graphs indicate that KLS is capable of finding considerably satisfactory cliques with reasonable running times in comparison with those of state-of-the-art metaheuristics.