A branch-and-bound based exact algorithm for the maximum edge-weight clique problem

Abstract

The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is maximum for a given edge-weighted undirected graph. The problem is NP-hard and was formulated as a mathematical programming problem in previous studies. In this paper, we propose an exact algorithm based on branch-and-bound. By some computational experiments, we confirmed our proposal algorithm is faster than the methods based on mathematical programming.