On Shortest Path Problems with “Non-Markovian” Link Contribution to Path Lengths
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 859-870
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costsNetworks, 1998
- Quality-of-service routing for supporting multimedia applicationsIEEE Journal on Selected Areas in Communications, 1996
- Minimum weight paths in time‐dependent networksNetworks, 1991
- Algorithms for the quickest path problem and the enumeration of quickest pathsComputers & Operations Research, 1991
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- Algorithms for finding paths with multiple constraintsNetworks, 1984
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A Tournament ProblemThe American Mathematical Monthly, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958