Efficient modeling of travel in networks with time-varying link speeds
- 1 September 2000
- Vol. 36 (2), 80-90
- https://doi.org/10.1002/1097-0037(200009)36:2<80::aid-net2>3.0.co;2-b
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A user‐optimum route navigation model with a massively parallel computing architectureTransportation Planning and Technology, 1994
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Shortest paths with euclidean distances: An explanatory modelNetworks, 1978
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959