Grenade Explosion Method for Maximum Weight Clique Problem

Maximum weight clique problem is an NP-Hard problem which seeks the fully connected subgraph of maximum weight in a given vertex weighted graph G. In this paper, we have used a recently proposed metaheuristic technique called Grenade Explosion Method (GEM) to solve the maximum weight clique problem. GEM was originally designed for continuous optimization problems. We have suitably modified the GEM so that it can be applied to a discrete optimization problem. To our knowledge this is the first approach which uses GEM for the discrete optimization. Computational results on the benchmark instances show the effectiveness of our proposed GEM approach.