Efficient implementation of heuristics for the continuous network design problem
暂无分享,去创建一个
[1] Donald W. Hearn,et al. The gap function of a convex program , 1982, Operations Research Letters.
[2] Larry J. LeBlanc,et al. AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .
[3] Terry L. Friesz,et al. Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..
[4] Mike Smith,et al. The existence, uniqueness and stability of traffic equilibria , 1979 .
[5] M. Fukushima. A modified Frank-Wolfe algorithm for solving the traffic assignment problem , 1984 .
[6] Patrice Marcotte,et al. Network design problem with congestion effects: A case of bilevel programming , 1983, Math. Program..
[7] D. Hearn,et al. Simplical decomposition of the asymmetric traffic assignment problem , 1984 .
[8] Michael Florian,et al. An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.
[9] Patrice Marcotte,et al. Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem , 1988, Transp. Sci..
[10] Stella Dafermos,et al. Traffic Equilibrium and Variational Inequalities , 1980 .
[11] Larry J. LeBlanc,et al. CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .
[12] P. Marcotte. Network Optimization with Continuous Control Parameters , 1983 .