4Martine L, Hande Y, Eric G. A branch and cut algorithm for hub location problems with single assignment [J ]. Mathematical Programming, 2005, 102 (2):371-405.
5Aljarad S N, Black W R. Modeling Saudi Arabia- Bahrain corridor mode choice[J]. Journal of Transport Geography. 1995,3(4) :257-268.
6Boyce D E, Janson B N. A discrete transportation network design problem with combined trip distribution and assignment[J]. Transportation Research B. 1998(14) : 147-153.
7Chen M, Alfa A S. A network design algorithm using a stochastic incremental traffic assignment ap proach[J ]. Transportation Science, 1991 ( 25 ) : 215-224.
8LeBlanc L J.An algorithm for the discrete network design problem[J].Transportation Science,1975,9:183-199
9LeBlanc L J,Boyce D E.a bi-level programming algorithm for exact solution of the network design problem with useoptimal flows[J].Transportation Research,1986,20B:259-265
10Yang H,Bell M G H.Models and algorithms for road network design:a review and some new developments[J].Transport Reviews,1998,18:257-278
