Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem

Alexander Belyi, Stanislav Sobolevsky, Alexander Kurbatski +1

We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clu…