A simplicial decomposition method for the transit equilibrium assignment problem
暂无分享,去创建一个
[1] J D Cea Ch. TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFICIENT NEW ALGORITHM , 1989 .
[2] J D Cea,et al. TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM , 1989 .
[3] D. Bertsekas,et al. Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .
[4] Jong-Shi Pang,et al. Iterative methods for variational and complementarity problems , 1982, Math. Program..
[5] Jong-Shi Pang,et al. Linearized simplicial decomposition methods for computing traffic equilibria on networks , 1984, Networks.
[6] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[7] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[8] J. Wardrop. ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .
[9] Stella Dafermos,et al. Traffic Equilibrium and Variational Inequalities , 1980 .
[10] Joaquin De Cea,et al. EQUILIBRIUM ASSIGNMENT ON CONGESTED TRANSIT NETWORKS , 1988 .
[11] Jean-Pierre Dussault,et al. Convex quadratic programming with one constraint and bounded variables , 1986, Math. Program..
[12] S. Pallottino,et al. Hyperpaths and shortest hyperpaths , 1989 .
[13] M. Florian,et al. The convergence of diagonalization algorithms for asymmetric network equilibrium problems , 1982 .
[14] Jia Hao Wu,et al. Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..
[15] Michael Florian,et al. Optimal strategies: A new assignment model for transit networks , 1989 .
[16] D. Hearn,et al. Simplical decomposition of the asymmetric traffic assignment problem , 1984 .