Tag
This paper introduces the edge-based contiguous p-median (ECpM) problem for partitioning road networks into compact territories, proposing two binary programming models with contiguity constraints and testing them on large road networks. The shortest-path constraint model achieves significant speedups over a cut set-based branch-and-cut approach, with connections to logistics districting.