The Balanced Connected k-Partition Problem: Polyhedra and Algorithms

Abstract

The balanced connected k-partition (BCPk) problem consists in partitioning a connected graph into connected subgraphs with similar weights. This problem arises in multiple practical applications, such as police patrolling, image processing, data base and operating systems. In this work, we address the BCPk using mathematical programming. We propose a compact formulation based on flows and a formulation based on separators. We introduce classes of valid inequalities and design polynomial-time separation routines. Moreover, to the best of our knowledge, we present the first polyhedral study for BCPk in the literature. Finally, we report on computational experiments showing that the proposed algorithms significantly outperform the state of the art for BCPk.