Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands

[1]  Anna Nagurney,et al.  Comparative tests of multimodal traffic equilibrium methods , 1984 .

[2]  D. Hearn,et al.  Simplical decomposition of the asymmetric traffic assignment problem , 1984 .

[3]  Mike Smith,et al.  An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function , 1983 .

[4]  Stella Dafermos,et al.  An iterative scheme for variational inequalities , 1983, Math. Program..

[5]  Jong-Shi Pang,et al.  Iterative methods for variational and complementarity problems , 1982, Math. Program..

[6]  S. Dafermos.  Relaxation Algorithms for the General Asymmetric Traffic Equilibrium Problem , 1982 .

[7]  Stella Dafermos,et al.  The general multimodal network equilibrium problem with elastic demand , 1982, Networks.

[8]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[9]  Mike Smith,et al.  The existence, uniqueness and stability of traffic equilibria , 1979 .

[10]  Michael Florian,et al.  A Method for Computing Network Equilibrium with Elastic Demands , 1974 .

[11]  George L. Nemhauser,et al.  A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[12]  S. Dafermos.  The Traffic Assignment Problem for Multiclass-User Transportation Networks , 1972 .

[13]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[14]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[15]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[16]  Michael Florian,et al.  Recent Experience with Equilibrium Methods for the Study of a Congested Urban Area , 1976 .