Clustered maximum weight clique problem: Algorithms and empirical analysis

The paper presents several mathematical programming formulations of the CCP and proposes matheuristic solution approaches. The computational study is performed on the clustered adaptations of the DIMACS and BHOSLIB benchmark instances for the Maximum Weight Clique Problem. The achieved results are encouraging.