Finding Shortest Paths Under Time-Bandwidth Constraints by Using Elliptical Minimal Search Area
Travel demand and land use ; 2006 ; Washington, DC
2006-01-01
9 pages
Includes bibliographical references
Aufsatz (Konferenz)
Englisch
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Finding Shortest Paths Under Time-Bandwidth Constraints by Using Elliptical Minimal Search Area
Transportation Research Record | 2006
|Finding Shortest Paths Under Time-Bandwidth Constraints by Using Elliptical Minimal Search Area
Online Contents | 2006
|Finding Shortest Paths under Time–Bandwidth Constraints by using Elliptical Minimal Search Area
Transportation Research Record | 2006
|Finding the k reliable shortest paths under travel time uncertainty
Elsevier | 2016
|Finding the k reliable shortest paths under travel time uncertainty
Online Contents | 2016
|