Farvaresh, Hamid; Sepehri, Mohammad - In: Networks and Spatial Economics 13 (2013) 1, pp. 67-106
Discrete network design problem (DNDP) is generally formulated as a bi-level programming. Because of non-convexity of bi-level formulation of DNDP which stems from the equilibrium conditions, finding global optimal solutions are very demanding. In this paper, a new branch and bound algorithm...