Simple ingredients leading to very efficient heuristics for the maximum clique problem

  • Authors:

  • Andrea Grosso;Marco Locatelli;Wayne Pullan

  • Affiliations:

  • Dip. Informatica, Università di Torino, Torino, Italy;Dip. Informatica, Università di Torino, Torino, Italy;School of Information and Communication Technology, Griffith University, Gold Coast, Australia

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (not based on node evaluation but on completely random selection) and simple, yet very effective, diversification techniques and restart rules. A detailed computational study is performed in order to identify strengths and weaknesses of the proposed algorithms and the role of the different components on several classes of instances. The tested algorithms are very fast and reliable: most of the DIMACS benchmark instances are solved within very short CPU times. For one of the hardest tests, a new putative optimum was discovered by one of our algorithms. Very good performances were also shown on recently proposed and more difficult instances. It is important to remark that the heuristics tested in this paper are basically parameter free (the appropriate value for the unique parameter is easily identified and was, in fact, the same value for all problem instances used in this paper).