Lagrangian relaxation and enumeration for solving constrained shortest-path problems