We study the resource-constrained minimum cost path problem with relays (RMCPR).
We present a pattern-chain formulation and develop an exact approach for the RMCPR.
We design a Lagrangian relaxation based method to solve the pricing problem.
Results show that our algorithm is an efficient exact method for the RMCPR.