Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
DGX agentarXiv:2606.01987v1 Announce Type: cross Abstract: We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem. Under a simple edge-deletion c