Jul 2026
A Graph Matching Based Approach for the Multi-Depot Capacitated Vehicle Routing Problem
It is proved that for tours of up to two targets the matching formulation solves the MDCVRP exactly in polynomial time for any number of depots, and that both algorithms are constant-factor approximations, with a tight factor of two, in the structured regimes.
Jayant Chandwani, Pranav M R, Anand Jat et al.
· arXiv.org · 0 citations