Journal
INFORMATION PROCESSING LETTERS
Volume 95, Issue 5, Pages 503-511Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2005.05.010
Keywords
graph algorithms; combinatorial optimization; variable depth search; neighborhood; maximum clique problem
Categories
Ask authors/readers for more resources
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. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available