We addressed the scheduling and routing of a repair crew after a disaster.
We present a dynamic programming model that solves small/mid-sized problems.
We develop a IGRCP procedure to solve large problem instances efficiently.
Our work has societal impact as it helps to efficiently repair a network damaged by a disaster.
Considering the routing of the repair crew makes the problem more realistic.