A dual ascent algorithm for traffic assignment problems
- 31 December 1990
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 24 (6) , 423-430
- https://doi.org/10.1016/0191-2615(90)90037-y
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Lagrangian dual ascent by generalized linear programmingOperations Research Letters, 1989
- On the dual approach to the traffic assignment problemTransportation Research Part B: Methodological, 1984
- A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMSJournal of the Operations Research Society of Japan, 1984
- Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problemsTransportation Research Part B: Methodological, 1981
- The effect on equilibrium trip assignment of different link congestion functionsTransportation Research Part A: General, 1981
- On the traffic assignment problem with flow dependent costs—IITransportation Research, 1977
- On the traffic assignment problem with flow dependent costs—ITransportation Research, 1977
- Generalized Linear Programming Solves the DualManagement Science, 1976
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956