Solving k-cluster problems to optimality with semidefinite programming
This paper deals with the computation of exact solutions of a classical NP-hard problem in combinatorial optimization, the -cluster problem. This problem consists in finding a heaviest subgraph with nodes in an edge weighted graph. We present a branch-and-bound algorithm that applies a novel bounding procedure, based on recent semidefinite programming techniques. We use new semidefinite bounds that are less tight than the standard semidefinite bounds, but cheaper to get. The experiments show that this approach is competitive with the best existing ones.
k-cluster semidefinite programming combinatorial optimization branch-and-bound exact resolution lagrangian relaxation