Overview - Version
- 0.1
We want to solve the vehicle routing problem (VRP) on a graph with , where is the depot and the distances are given by the length function . Consider the MIP formulation
where is the set of tours visiting at most customers with repetitions of customers allowed and counts how often edge e (node j) is traversed in . |