Dijkstra's algorithm revisited: The dynamic programming connexion

Control and Cybernetics

Volumn 35, Issue 3, 2006, Pages 599-620

  Sniedovich, Moshe ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Computer science; Dijkstra's algorithm; Dynamic programming; Greedy algorithm; Operations research; Principle of optimality; Successive approximation

Indexed keywords

EID: 33947220906     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (29)

1. AHUJA, R.K., MAGNANTI, T.L. and ORLIN, J.B. (1993) Network Flow Theory, Algorithms, and Applications. Prentice-Hall, Englewood-Cliffs, NJ.
2. BELLMAN, R. (1952) On the theory of dynamic programming. Proceedings of the National Academy of Sciences, 38, 716-719.
3. BELLMAN, R. (1957) Dynamic Programming. Princeton University Press, Princeton, NJ.
4. BELLMAN, R. (1958) On a routing problem. Quarterly of Applied Mathematics 16 (1), 87-90.
5. BERGE, C. (1958) Theorie des Graphes et ses Applications. Dunod, Paris.
6. BERTSEKAS, D. (1991) Linear Network Optimization. The MIT Press, Cambridge, MA.
7. BIRD, R. and DE MOOR, O. (1997) The Algebra of Programming. Prentice Hall.
8. BRASSARD, G. and BRATLEY, P. (1988) Algorithmes. Prentice-Hall, Englewood Cliffs, NJ.
9. CORMEN, T.H., LEISERSON, C.E. and RIVEST, R.L. (1990) Introduction to Algorithms. The MIT Press, Cambride, MA.
10. DAELLENBACH, H.G., GEORGE, J.A. and MCNICKLE, D.C. (1983) Introduction to Operations Research Techniques, 2nd Edition. Allyn and Bacon. Boston.
11. DANTZIG, G.B. (1960) On the shortest path route through a network. Management Science 6, 187-190.
12. DENARDO, E.V. and FOX, B.L. (1979) Shortest-route methods: I. Reaching, pruning, and buckets. Operations Research 27, 161-186.
13. DENARDO, E.V. (2003) Dynamic Programming. Dover, Mineola, NY.
14. DUKSTRA, E.W. (1959) A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271.
15. DREYFUS, S. (1969) An appraisal of some shortest-path algorithms. Operations Research 17, 395-412.
16. EVANS, J.R. and MINIEKA, E. (1992) Optimization Algorithms for Networks and Graphs. Marcel Dekker, NY.
17. FORD, L.R. (1956) Network Flow Theory. RAND paper P-923.
18. FORD, L.R. and FULKERSON, D.R. (1958) Constructing maximal dynamic flows from static flows. Operations Research 6, 419-433.
19. FORD, L.R. and FULKERSON, D.R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ.
20. GALLO, G. and PALLOTTINO, S. (1988) Shortest path algorithms. Annals of Operations Research 13, 3-79.
21. GASS, S.I. and HARRIS, C.M. (1996) Encyclopedia of Operations Research and Management Science. Kluwer, Boston, Mass.
22. HILLIER, F.S. and LIEBERMAN, G.J. (1990) Introduction to Operations Research, 5th Edition. Holden-Day, Oakland, CA.
23. KRUSKAL, J.B., JR. (1956) On the shortest spanning tree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1), 48-50.
24. LAWLER, E.L. (1976) Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Whinston, NY.
25. LEW, A. (2005) Canonical greedy algorithms and dynamic programming. Journal of Control and Cybernetics, this issue.
26. MARKLAND, R.E. and SWEIGART, J.R. (1987) Quantitative Methods: Applications to Managerial Decision Making. John Wiley, New York.
27. POLLACK M. and WIEBENSON, W. (1960) Solution of the shortest-route problem - a review. Operations Research 8, 224-230.
28. SNIEDOVICH, M. (1992) Dynamic Programming. Marcel Dekker, NY.
29. WINSTON, W.L. (2004) Operations Research Applications and Algorithms. Fourth Edition. Brooks/Cole, Belmont, CA.