  State-of-the-art exact methods for vehicle routing problems (VRPs) often use
a branch-price-and-cut framework. Valid inequalities are 'non-robust' if they
complicate the pricing subproblem and 'robust' if they do not. We introduce
'resource-robust' as an in-between class. Such valid inequalities are robust
when specific resources are present in the subproblem. For ng-route resources,
we introduce resource-robust variants of the capacity cuts, k-path cuts, strong
degree constraints, and subset-row inequalities. Computational experiments show
the ng-capacity cuts' potential in solving the capacitated VRP.
