An improved exact algorithm for a territory design problem with p-center-based dispersion minimization

•A districting problem with p-center minimization function is addressed.•An exact algorithm with a covering reformulation for fasternvergence is proposed.•The algorithm uses a cut-generation strategy for ensuring territory connectivity.•Tests with 140 instances with up to 300 nodes prove the efficiency of the method.•The algorithm outperforms the best existing approach based on statistical analysis.