A Computational Approach to the Selection of an Optimal Network

We consider the problem of selecting an optimal traffic network in its simplest form, where there are no congestion costs. The superadditive effect of deleted links on the objective function is pointed out and used to develop some implicit enumeration procedures for this problem. Some efforts are devoted to evaluate these algorithms, and to show how to stop the computations with an “acceptable” approximate solution when computations are taking too much time.