The Edge-based Contiguous p-median Problem with Connections to Logistics Districting
The hosts discuss a paper on 'Edge-based Contiguous p-median Problem' related to logistics districting. They compare two methods for ensuring contiguous territories: cut-set constraints and shortest-path constraints. The conclusion is that the simpler, shorter path method is significantly faster and more reliable than the cut-set approach, making it ideal for real-world delivery planning.