A modified Frank-Wolfe algorithm for solving the traffic assignment problem

[1]  Stanley B. Gershwin,et al.  Pilot study of computer-based urban traffic management , 1980 .

[2]  Larry J. LeBlanc,et al.  Methods for Combining Modal Split and Equilibrium Assignment Models , 1979 .

[3]  Michael Florian.  An improved linear approximation algorithm for the network equilibrium (packet switching) problem , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[4]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[5]  Charles A. Holloway.  An extension of the frank and Wolfe method of feasible directions , 1974, Math. Program..

[6]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[7]  R. W. Klessig,et al.  An algorithm for nonlinear multicommodity flow problems , 1974, Networks.

[8]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[9]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[10]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

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

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

[13]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .