R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-104, 1972.
DOI : 10.1007/978-1-4684-2001-2_9

I. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization, pp.1-74, 1999.
DOI : 10.1007/978-1-4757-3023-4_1

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.256-278, 1974.
DOI : 10.1145/800125.804034
URL : http://doi.org/10.1016/s0022-0000(74)80044-9

T. A. Feo, M. G. Resende, and S. H. Smith, A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Operations Research, vol.42, issue.5, pp.860-878, 1994.
DOI : 10.1287/opre.42.5.860

J. Abello, P. M. Pardalos, and M. G. Resende, On maximum clique problems in very large graphs, External Memory Algorithms, pp.119-130, 1999.
DOI : 10.1090/dimacs/050/06
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.5786

R. Battiti and M. Protasi, Reactive Local Search for the Maximum Clique Problem1, Algorithmica, vol.29, issue.4, pp.610-637, 2001.
DOI : 10.1007/s004530010074
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4667

A. Jagota and L. A. Sanchis, Adaptive, restart, randomized greedy heuristics for maximum clique, Journal of Heuristics, vol.7, issue.6, pp.565-585, 2001.
DOI : 10.1023/A:1011925109392

A. Grosso, M. Locatelli, and F. Della-croce, Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem, Journal of Heuristics, vol.10, issue.2, pp.135-152, 2004.
DOI : 10.1023/B:HEUR.0000026264.51747.7f

E. H. Aarts and J. H. Korst, Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, 1989.

S. Homer and M. Peinado, Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs, Cliques, Coloring, and Satisfiability, pp.147-168, 1996.
DOI : 10.1090/dimacs/026/09

C. Friden, A. Hertz, and D. De-werra, STABULUS: Eine Technik zur Bestimmung unabh??ngiger Knotenmengen in gro??en Graphen mit der Tabu-Search-Methode, Computing, vol.9, issue.1, pp.35-44, 1989.
DOI : 10.1007/BF02243141

F. Glover and M. Laguna, Tabu search, Modern Heuristics Techniques for Combinatorial Problems, pp.70-141, 1993.
URL : https://hal.archives-ouvertes.fr/hal-01412610

M. Gendreau, P. Soriano, and L. Salvail, Solving the maximum clique problem using a tabu search approach, Annals of Operations Research, vol.41, issue.4, pp.385-403, 1993.
DOI : 10.1007/BF02023002

E. Marchiori, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf et al., Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem, Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTim, volume 2279 of lncs, pp.112-121, 2002.
DOI : 10.1007/3-540-46004-7_12

M. Dorigo and G. Caro, Ant colony optimization: a new meta-heuristic, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
DOI : 10.1109/CEC.1999.782657
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7911

M. Dorigo, G. D. Caro, and L. M. Gambardella, Ant Algorithms for Discrete Optimization, Artificial Life, vol.54, issue.1, pp.137-172, 1999.
DOI : 10.1007/BF01797237
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.6569

T. Jones and S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, Proceedings of the Sixth International Conference on Genetic Algorithms, pp.184-192, 1995.

P. Merz and B. Freisleben, Fitness landscapes and memetic algorithm design, New Ideas in Optimization, pp.245-260, 1999.
DOI : 10.1162/106365600568103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6968

T. Stützle, H. H. Hoos, . Max, . Min-ant, and . System, ??? Ant System, Future Generation Computer Systems, vol.16, issue.8, pp.889-914, 2000.
DOI : 10.1016/S0167-739X(00)00043-1

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.29-41, 1996.
DOI : 10.1109/3477.484436

M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.53-66, 1997.
DOI : 10.1109/4235.585892
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8411

L. M. Gambardella, E. Taillard, and M. Dorigo, Ant colonies for the quadratic assignment problem, Journal of the Operational Research Society, vol.50, issue.2, pp.167-176, 1999.
DOI : 10.1057/palgrave.jors.2600676
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.2245

V. Maniezzo and A. Colorni, The ant system applied to the quadratic assignment problem, IEEE Transactions on Knowledge and Data Engineering, vol.11, issue.5, pp.769-778, 1999.
DOI : 10.1109/69.806935
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7683

B. Bullnheimer, R. F. Hartl, and C. Strauss, An improved ant system algorithm for the vehicle routing problem, Annals of Operations Research, vol.89, pp.319-328, 1999.
DOI : 10.1023/A:1018940026670

L. M. Gambardella, E. D. Taillard, and G. Agazzi, MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows, New Ideas in Optimization, pp.63-76, 1999.

C. Solnon, Solving permutation constraint satisfaction problems with artificial ants, Proceedings of ECAI'2000, pp.118-122, 2000.

C. Solnon, Ants can solve constraint satisfaction problems, IEEE Transactions on Evolutionary Computation, vol.6, issue.4, pp.347-357, 2002.
DOI : 10.1109/TEVC.2002.802449
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.8960

S. Fenet, C. Solnon, S. Cagnoni, J. Gottlieb, E. Hart et al., Searching for Maximum Cliques with Ant Colony Optimization, Applications of Evolutionary Computing, Proceedings of EvoWorkshops 2003: EvoCOP, EvoIASP, EvoSTim, volume 2611 of lncs, pp.236-245, 2003.
DOI : 10.1007/3-540-36605-9_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4090

T. N. Bui, J. R. Rizzo-deb, R. Poli, W. Banzhaf, H. Beyer et al., Finding Maximum Cliques with Distributed Ants, Genetic and Evolutionary Computation -GECCO 2004, pp.24-35, 2004.
DOI : 10.1007/978-3-540-24854-5_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.337.2105

J. I. Van-hemert and T. Bäck, Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction, Proceedings of the 7th International Conference on Parallel Problem Solving from Nature, volume 2439 of lncs, pp.23-32, 2002.
DOI : 10.1007/3-540-45712-7_3

A. Colorni, M. Dorigo, and V. Maniezzo, An investigation of some properties of an ant algorithm, Parallel Problem Solving from Nature, pp.515-526, 1992.

C. Solnon, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf et al., Boosting ACO with a Preprocessing Step, Applications of Evolutionary Computing, Proceedings of EvoWorkshops2002: EvoCOP, EvoIASP, EvoSTim, volume 2279 of lncs, pp.161-170, 2002.
DOI : 10.1007/3-540-46004-7_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4753

M. Birattari, T. Stützle, L. Paquete, K. Varrentrapp, W. B. Langdon et al., A racing algorithm for configuring metaheuristics, Proceedings of the Genetic and Evolutionary Computation Conference, pp.11-18, 2002.

R. Burke, S. Gustafson, G. Kendall, W. B. Langdon, E. Cantú-paz et al., A survey and analysis of diversity measures in genetic programming, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp.716-723, 2002.

J. I. Van-hemert and C. Solnon, A study into ant colony optimization, evolutionary computation and constraint programming on binary constraint satisfaction problems, Evolutionary Computation in Combinatorial Optimization, pp.114-123, 2004.

A. Sidaner, O. Bailleux, and J. Chabrier, Measuring the spatial dispersion of evolutionist search processes: application to walksat, 5th International Conference, pp.77-90, 2001.

R. W. Morrison, K. A. De, and . Jong, Measurement of Population Diversity, 5th International Conference EA 2001, volume 2310 of lncs, pp.31-41, 2001.
DOI : 10.1007/3-540-46033-0_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.1903

H. R. Lourenço, O. Martin, and T. Stützle, Iterated Local Search, Handbook of metaheuristics, pp.321-353, 2002.
DOI : 10.1007/0-306-48056-5_11

M. Brockington and J. C. Culberson, Camouflaging independent sets in quasi-random graphs, Cliques, Coloring, and Satisfiability, pp.75-88, 1996.
DOI : 10.1090/dimacs/026/05
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.9493