Abstract
The solution of the optimal equilibrium network design problem is perhaps the most computationally intensive problem encountered in transportation network analysis. This paper illustrates through the use of game-theoretic concepts how one can bound the solution of the continuous version of this problem by using two computationally efficient heuristics.