Partitioning a graph into balanced connected classes: Formulations, separation and experiments

• Integer and flow-based mixed integer linear programming formulations. • Polynomial-time separation routines for the integer linear programming model. • Algorithms tested on instances from the literature and on newly generated ones. • Proposed approaches outperform the exact algorithms known in the literature. • Real-world and random instances for the problem made publicly available. This work addresses the balanced connected k -partition...