AI RESEARCH
Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
arXiv CS.LG
•
ArXi:2606.01987v1 Announce Type: cross We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem. Under a simple edge-deletion cost model, minimizing total route cost is equivalent to maximizing the total weight of edges deleted from the complete instance graph.