A class of bush-based algorithms for the traffic assignment problem
- 1 January 2010
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 44 (1) , 73-89
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumerationTransportation Research Part B: Methodological, 2006
- Second Derivative Algorithms for Minimum Delay Distributed Routing in NetworksIEEE Transactions on Communications, 1984
- Projected Newton methods and optimization of multicommodity flowsIEEE Transactions on Automatic Control, 1983
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- An efficient approach to solving the road network equilibrium traffic assignment problemTransportation Research, 1975
- A probabilistic multipath traffic assignment model which obviates path enumerationTransportation Research, 1971
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952