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

Authors:
Elena Marchiori
Affiliations:
-
Venue:
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Year:
2002

Citing 10
Cited 15

Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
On the effectiveness of genetic search in combinatorial optimization

SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
A simple heuristic based genetic algorithm for the maximum clique problem

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
A Hybrid Genetic Algorithm for the Maximum Clique Problem

Proceedings of the 6th International Conference on Genetic Algorithms
How good are genetic algorithms at finding large cliques: an experimental

How good are genetic algorithms at finding large cliques: an experimental
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.

Solving the maximum clique problem by k-opt local search

Proceedings of the 2004 ACM symposium on Applied computing
An effective local search for the maximum clique problem

Information Processing Letters
A study of ACO capabilities for solving the maximum clique problem

Journal of Heuristics
A leader-based parallel cross entropy algorithm for MCP

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Error Correcting Codes from Quasi-Hadamard Matrices

WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Dynamic local search for the maximum clique problem

Journal of Artificial Intelligence Research
Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph

Fundamenta Informaticae
An effective local search for the maximum clique problem

Information Processing Letters
Iterated k-opt local search for the maximum clique problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Searching for maximum cliques with ant colony optimization

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Cooperating local search for the maximum clique problem

Journal of Heuristics
Combinatorial algorithms for the maximum k-plex problem

Journal of Combinatorial Optimization
An adaptive multistart tabu search approach to solve the maximum clique problem

Journal of Combinatorial Optimization
Improvements to MCS algorithm for the maximum clique problem

Journal of Combinatorial Optimization
Speeding up branch and bound algorithms for solving the maximum clique problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.