Abstract
This paper compares experimentally three heuristic algorithms for the maximum clique problem obtained as instances of an evolutionary algorithm scheme. The algorithms use three popular heuristic methods for combinatorial optimization problems, known as genetic, iterated and multistart local search, respectively. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Marchiori, E. (2002). Genetic, iterated and multistart local search for the maximum clique problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2279 LNCS, pp. 112–121). Springer Verlag. https://doi.org/10.1007/3-540-46004-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
