Date: 14 Mar 2002

Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem

* Final gross prices may vary according to local VAT.

Get Access


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.