Abstract
Given an undirected graph G=(V,E) with vertex set V={1,…,n} and edge set E⊆V×V. The maximum clique problem is to determine in G a clique (i.e., a complete subgraph) of maximum cardinality. This paper presents an effective algorithm for the maximum clique problem. The proposed multistart tabu search algorithm integrates a constrained neighborhood, a dynamic tabu tenure mechanism and a long term memory based restart strategy. Our proposed algorithm is evaluated on the whole set of 80 DIMACS challenge benchmarks and compared with five state-of-the-art algorithms. Computational results show that our proposed algorithm attains the largest known clique for 79 benchmarks.
Similar content being viewed by others
Notes
The source code of AMTS is available at: http://www.info.univ-angers.fr/pub/hao/amts.html.
References
Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15(4):1054–1068
Barbosa V, Campos L (2004) A novel evolutionary formulation of the maximum independent set problem. J Comb Optim 8(4):419–437
Battiti R, Mascia F (2010) Reactive and dynamic local search for max-clique: engineering effective building blocks. Comput Oper Res 37(3):534–542
Battiti R, Protasi M (2001) Reactive local search for the maximum clique problem. Algorithmica 29(4):610–637
Bui T, Eppley P (1995) A hybrid genetic algorithm for the maximum clique problem. In: Proceedings of the 6th international conference on genetic algorithms, pp 478–484
Busygin S, Butenko S, Pardalos PM (2002) A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J Comb Optim 6(3):287–297
Busygin S (2006) A new trust region technique for the maximum weight clique problem. Discrete Appl Math 154(1):2080–2096
Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375–382
Fleurent C, Ferland J (1996) Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Johnson D, Trick M (eds) Proceedings of the 2nd DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol 26. Am. Math. Soc., Providence, pp 619–652
Friden C, Hertz A, de Werra D (1989) Stabulus: A technique for finding stable sets in large graphs with tabu search. Computing 42:35–44
Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379–397
Gendreau M, Soriano P, Salvail L (1993) Solving the maximum clique problem using a tabu search approach. Ann Oper Res 41:385–403
Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Norwell
Grosso A, Locatelli M, Pullan W (2008) Simple ingredients leading to very efficient heuristics for the maximum clique problem. J Heuristics 14(6):587–612
Johnson DS, Trick MA (1996) Second DIMACS implementation challenge: cliques, coloring and satisfiability. DIMACS series in discrete mathe-matics and theoretical computer science, vol 26. Am. Math. Soc., Providence
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85–103
Katayama K, Hamamoto A, Narihisa H (2005) An effective local search for the maximum clique problem. Inf Process Lett 95(5):503–511
Marchiori E (1998) A simple heuristic based genetic algorithm for the maximum clique problem. In: Proceedings of ACM symposium on applied computing, pp 366–373
Marchiori E (2002) Genetic, iterated and multistart local search for the maximum clique problem. In: Applications of evolutionary computing. Proceedings of EvoWorkshops, vol 2279, pp 112–121
Östergärd PJR (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120:195–205
Pardalos PM, Xue J (2002) The maximum clique problem. J Glob Optim 4:301–328
Pullan W (2006) Phased local search for the maximum clique problem. J Comb Optim 12(3):303–323
Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25:159–185
Rebennack S, Oswald M, Theis DO, Seitz H, Reinelt G, Pardalos PM (2011) A Branch and Cut solver for the maximum stable set problem. J Comb Optim 21(4):434–457
Singh A, Gupta AK (2008) A hybrid heuristic for the maximum clique problem. J Heuristics 12:5–22
Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Math Theor Comput Sci 2731:278–289
Zhang QF, Sun JY, Tsang E (2005) Evolutionary algorithm with the guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2):192–200
Wu Q, Hao JK (2012a) Coloring large graphs based on independent set extraction. Comput Oper Res 39(2):283–290
Wu Q, Hao JK (2012b) An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7):1593–1600. doi:10.1016/j.cor.2011.09.010
Acknowledgement
We are grateful to the referees for their comments and questions which helped us to improve the paper. This work was partially supported by the Region of “Pays de la Loire” (France) within the Radapop and LigeRO Projects.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, Q., Hao, JK. An adaptive multistart tabu search approach to solve the maximum clique problem. J Comb Optim 26, 86–108 (2013). https://doi.org/10.1007/s10878-011-9437-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9437-8