Researchers have introduced a new problem formulation called the edge-based contiguous p-median (ECpM) problem, designed to partition road networks into compact and contiguous territories. The paper presents two binary programming models to address this, one using a branch-and-cut algorithm with exponential constraints and another employing a polynomial number of shortest-path constraints solvable by standard solvers. The latter approach demonstrated significant speedups, achieving up to 17x faster computation times on large road networks compared to the cut set-based method. AI
RANK_REASON The cluster contains a single academic paper detailing a new problem formulation and solution approaches. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
