A platform for research: civil engineering, architecture and urbanism
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
Session, Forecasting, travel behavior, and network modeling ; 1998 ; Washington; DC [unconfirmed]
1998-01-01
6 pages
Held as part of the 77th annual meeting of the Transportation Research Board
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
British Library Online Contents | 1998
|British Library Online Contents | 2001
|Time Dependent Shortest Path on Urban Transportation Network
British Library Conference Proceedings | 2005
|Shortest Path Planning Strategies through Evolutionary Algorithms
British Library Online Contents | 2007
|Adaptive Reliable Shortest Path in Discrete Stochastic Networks
British Library Conference Proceedings | 2014
|