Qinghua Wu, Jin-Kao Hao, Fred Glover


Given an undirected graph G=(V,E) with vertex set V={1,…,n} and edge set E⊆V×V. Let w:V→Z+ be a weighting function that assigns to each vertex i∈V a positive integer. The maximum weight clique problem (MWCP) is to determine a clique of maximum weight. This paper introduces a tabu search heuristic whose key features include a combined neighborhood and a dedicated tabu mechanism using a randomized restart strategy for diversification. The proposed algorithm is evaluated on a total of 136 benchmark instances from different sources (DIMACS, BHOSLIB and set packing). Computational results disclose that our new tabu search algorithm outperforms the leading algorithm for the maximum weight clique problem, and in addition rivals the performance of the best methods for the unweighted version of the problem without being specialized to exploit this problem class.