Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming (1984)

by Thomas H. Byers , Michael S. Waterman
Venue:Operations Research
Citations:17 - 1 self

Active Bibliography

1246 Learning to predict by the methods of temporal differences – Richard S. Sutton - 1988
292 Finding the k Shortest Paths – David Eppstein - 1997
30 Error-resistant Implementation of DNA Computations – Martyn Amos, Alan Gibbons, David Hodgson
10 Parallel algorithms for solving aggregated shortest path problems. The – H. Edwin Romeijn, Robert L. Smith - 1999
7 Approximating shortest paths in largescale networks with an application to intelligent transportation systems – Yu-li Chou, Robert L. Smith - 1998
Dynamic Programming (DP) – Katta G. Murty
Dynamic Programming: an overview by – Moshe Sniedovich, Art Lew
196 Learning and Sequential Decision Making – Andrew G. Barto, R. S. Sutton, C. J. C. H. Watkins - 1989
1 Minimum Delay Routing In Multisatellite Networks – Ariel Orda, Raphael Rom, Moshe Sidi - 1993