Sørensen, Michael M. - Ehrvervøkonomisk Institut, Institut for Økonomi - 2005
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we present a branch-and-cut algorithm for the problem that...
