A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
11 Conventional discrete transportation network design problem deals with the optimal decision on 12 new link addition, assuming the capacity of each candidate link addition is predetermined and 13 fixed. In this paper, we address a novel yet general discrete network design problem formulation 14 that aims to determine the optimal new link addition and their optimal capacities simultaneously, 15 which answers the questions on whether a new link should be added or not, and if added, what 16doi:10.1016/j.tre.2015.04.005 fatcat:53hfk6b33zadtpk7p7e7eyhcvy