A simple simulated annealing algorithm for the maximum clique problem

Information Sciences

Volumn 177, Issue 22, 2007, Pages 5064-5071

  Geng, Xiutang ^a   Xu, Jin ^a   Xiao, Jianhua ^a   Pan, Linqiang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Heuristic algorithm; Maximum clique problem; Minimum vertex cover problem; NP hard optimization problem; Simulated annealing algorithm

Indexed keywords

COMPUTER SIMULATION; INFORMATION SCIENCE; PROBLEM SOLVING; SIMULATED ANNEALING;

MAXIMUM CLIQUE PROBLEMS; MINIMUM VERTEX COVER PROBLEMS; NP-HARD OPTIMIZATION PROBLEMS; SIMULATED ANNEALING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 34548217144     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.06.009     Document Type: Article

References (23)

1. Balas E., and Yu C.S. Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing 15 4 (1986) 1054-1068
2. Bandyopadhyay S., Pal S.K., and Murthy C.A. Simulated annealing based pattern classification. Information Sciences 109 (1998) 165-184
3. Bomze I.M., Budinich M., Pelillo M., and Rossi C. Annealed replication: a new heuristic for the maximum clique problem. Discrete Applied Mathematics 121 (2002) 27-49
4. Busygin S. A new trust region technique for the maximum weight clique problem. Discrete Applied Mathematics 154 (2006) 2080-2096
5. Carraghan R., and Pardalos P.M. An exact algorithm for the maximum clique problem. Operations Research Letters 9 (1990) 375-382
6. Dukanovic I., and Rendl F. Semi-definite programming relaxations for graph coloring and maximal clique problems. Mathematical Programming, Series B 109 (2007) 345-365
7. Galán-Mari{dotless}́n G., Mérida-Casermeiro E., and Muñoz-Pérez J. Modelling competitive Hopfield networks for the maximum clique problem. Computers and Operations Research 30 (2003) 603-624
8. Hansen P., Mladenovic N., and Uroševic D. Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145 (2004) 117-125
9. 1-ε. Acta Mathematica 182 (1999) 105-142
10. Katayama K., Hamamoto A., and Narihisa H. An effective local search for the maximum clique problem. Information Processing Letters 95 (2005) 503-511
11. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
12. Lin R.B., and Chen S.Y. Conjugate conflict continuation graphs for multi-layer constrained via minimization. Information Sciences 177 (2007) 2436-2447
13. Nalini N., and Raghavendra Rao G. Attacks of simple block ciphers via efficient heuristics. Information Sciences 177 (2007) 2553-2569
14. Östergård P.R.J. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120 (2002) 197-207
15. Pardalos P.M., and Rodger G.P. A branch and bound algorithm for the maximum clique problem. Computers and Operations Research 19 5 (1992) 363-375
16. Poranen T. A simulated annealing algorithm for determining the thickness of a graph. Information Sciences 172 (2005) 155-172
17. Sánchez L., Couso I., and Corrales J.A. Combining GP operators with SA search to evolve fuzzy rule based classifiers. Information Sciences 136 (2001) 175-191
18. Tomita E., and Kameda T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization 37 (2007) 95-111
19. Van-Laarhoven P.J.M., and Aarts E. Simulated Annealing: Theory and Applications (1987), Kluwer, Dordrecht
20. Xu X.S., and Ma J. An efficient simulated annealing algorithm for the minimum vertex cover problem. Neurocomputing 69 (2006) 913-916
21. Zhang X.D., and Li Z.L. Graph Theory and Its Applications (2005), Higher Education Publishing Company, Beijing
22. Zhang Q.F., Sun J.Y., and Tsang E. An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Transactions on Evolutionary Computation 9 2 (2005) 192-200
23. Zhang J.Y., Xu J., and Bao Z. Algorithm for the maximum clique and independent set of graphs based on Hopfield networks. Journal of Electronics 18 (1996) 122-127