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

  • Elena Marchiori
Conference paper

DOI: 10.1007/3-540-46004-7_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2279)
Cite this paper as:
Marchiori E. (2002) Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem. In: Cagnoni S., Gottlieb J., Hart E., Middendorf M., Raidl G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Elena Marchiori
    • 1
  1. 1.Department of Computer ScienceFree University AmsterdamHV AmsterdamThe Netherlands

Personalised recommendations