Solving the maximum clique problem using a tabu search approach

The authors describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. The authors also present a new random graph generator, the &pcedil;-generator, which produces graphs with larger clique ápresent a new random graph generator, the