Solving Maximum Clique Problems with ACO
AntClique is a program (in C) for solving maximum clique problems.
It is distributed under the CeCILL-B FREE SOFTWARE LICENSE.
The algorithms used by AntClique to search for maximum cliques are described in:
- Christine Solnon and Serge Fenet: A study of ACO capabilities for solving the Maximum Clique Problem. Heuristics - May 2006 - Volume 12 - Number 3 - pages 155-180 - Springer
A draft version is available as a research report LIRIS RR-2004-021 (pdf)
- Christine Solnon and Derek Bridge: An Ant Colony Optimization Meta-Heuristic for Subset Selection Problems. Chapter of the book « System Engineering using Particle Swarm Optimization » - March 2006 - Nova Science publisher - pages 7-29
A draft version is available as a research report LIRIS RR-2005-017 (pdf)
Ant Colony Optimization and Constraint Programming
Wiley-ISTE, ISBN: 978-1-84821-130-8, 232 pages
Table of contents