Efficient elementary and restricted non-elementary route pricing.

•We propose an efficient algorithm for the SPPRC based on ng-routes relaxation.•This algorithm is extended in order to solve the more difficult ESPPRC.•We report for the first time experiments with ng-set sizes up to 64.•We solve the ESPPRC for CVRP instances with up to 200 customers.•We obtain new lower bounds and optimality proofs for several GVRP instances.