Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions
Session, Transportation network modeling ; 2001 ; Washington, DC
2001-01-01
8 pages
Held as part of the 80th annual meeting of the Transportation Research Board
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Transportation Research Record | 2001
|Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Online Contents | 2001
|Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
British Library Conference Proceedings | 2001
|Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Transportation Research Record | 2001
|