Abstract
The problem to be considered is to find a method for solving interdependent road investment problems. This is done by formulating a dynamic network flow model, where investments can only be made at discrete dates. This model is solved in two phases, in the first one by linear programming and in the second one by dynamic programming.