Finding the best multimodal paths in urban transportation networks
World congress; 13th, Vol P; Aerospace, transportation systems ; 1996 ; San Francisco; CA
1997-01-01
6 pages
Aufsatz (Konferenz)
Englisch
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks
Online Contents | 1998
|Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks
Transportation Research Record | 1998
|ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS
British Library Conference Proceedings | 2002
|