Multi-neighborhood tabu search for the maximum weight clique problem

Annals of Operations Research

Volumn 196, Issue 1, 2012, Pages 611-634

  Wu, Qinghua ^a   Hao, Jin Kao ^a   Glover, Fred ^b  

^a UNIVERSITÉ D'ANGERS   (France)

^b OptTek Systems Inc   (United States)

Author keywords

Heuristics; Maximum clique; Maximum weight clique; Multi neighborhood search; Tabu search

Indexed keywords

EID: 84863201478     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-012-1124-3     Document Type: Article

References (24)

1. Alidaee, B., Kochenberger, G. A., Lewis, K., Lewis, M., & Wang, H. (2008). A new approach for modelling and solving set packing problems. European Journal of Operational Research, 86(2), 504-512.
2. Babel, L. (1994). A fast algorithm for the maximum weight clique problem. Computing, 52, 31-38.
3. Ballard, D., & Brown, C. (1982). Computer vision. Englewood Cliffs: Prentice-Hall.
4. Battiti, R., & Mascia, F. (2010). Reactive and dynamic local search for the Max-Clique problem: engineering effective building blocks. Computers & Operations Research, 37, 534-542.
5. Battiti, R., & Protasi, M. (2001). Reactive local search for the maximum clique problem. Algorithmica, 29(4), 610-637.
6. Bomze, I. M., Pelillo, M., & Stix, V. (2000). Approximating the maximum weight clique using replicator dynamics. IEEE Transactions on Neural Networks, 11, 1228-1241.
7. Busygin, S. (2006). A new trust region technique for the maximum weight clique problem. Discrete Applied Mathematics, 154, 2080-2096.
8. Cai, S., Su, K., & Chen, Q. (2011). Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artificial Intelligence, 175(9-10), 1672-1696.
9. Delorme, X., Gandibleux, X., & Rodriguez, J. (2004). GRASP for set packing problems. European Journal of Operational Research, 153, 564-580.
10. Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5(1), 65-89.
11. 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.
12. Gendreau, M., Soriano, P., & Salvail, L. (1993). Solving the maximum clique problem using a tabu search approach. Annals of Operations Research, 41, 385-403.
13. Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic.
14. Grosso, A., Locatelli, M., & Croce, F. D. (2004). Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. Journal of Heuristics, 10, 135-152.
15. Johnson, D. S., & Trick, M. A. (Eds.) (1996). Cliques, coloring, and satisfiability: second DIMACS Implementation Challenge. DIMACS series in discrete mathematics and theoretical computer science (Vol. 26). Providence: AMS.
16. Karp, R. M. (1972). Reducibility among combinatorial problems. In R.E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum Press.
17. Katayama, K., Hamamoto, A., & Narihisa, H. (2005). An effective local search for the maximum clique problem. Information Processing Letters, 95, 503-511.
18. Kwon, R. H. (2005). Data dependent worst case bounds for weighted set packing. European Journal of Operational Research, 167(1), 68-76.
19. Lü, Z., Hao, J. K., & Glover, F. (2011). Neighborhood analysis: a case study on curriculum-based course timetabling. Journal of Heuristics, 17(2), 97-118.
20. Mannino, C., & Stefanutti, E. (1999). An augmentation algorithm for the maximum weighted stable set problem. Computational Optimization and Applications, 14, 367-381.
21. Östergård, P. R. J. (2001). A new algorithm for the maximum weight clique problem. Nordic Journal of Computing, 8, 424-436.
22. Pullan, W. (2008). Approximating the maximum vertex/edge weighted clique using local search. Journal of Heuristics, 14(2), 117-134.
23. Pullan, W., & Hoos, H. H. (2006). Dynamic local search for the maximum clique problem. The Journal of Artificial Intelligence Research, 25, 159-185.
24. Wu, Q., & Hao, J. K. (2012). An adaptive multistart tabu search approach to solve the maximum clique problem. Journal of Combinatorial Optimization. doi: 10. 1007/s10878-011-9437-8.