-
DANTZIG, G.B. (1960) On the shortest path route through a network. Management Science 6, 187-190.
-
DENARDO, E.V. and Fox, B.L. (1979) Shortest-route methods: 1. Reaching, pruning, and buckets. Operations Research 27, 161-186.
-
DENARDO, E.V. (2003) Dynamic Programming. Dover, Mineola, NY.
-
DIJKSTRA, E.W. (1959) A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271.
-
DREYFUS, S. (1969) An appraisal of some shortest-path algorithms. Operations Research 17, 395-412.
-
EVANS. J.R. and MINIEKA, E. (1992) Optimization Algorithms for Networks and Graphs. Marcel Dekker, NY.
-
FORD, L.R. (1956) Network Flow Theory. RAND paper P-923.
-
FORD. L.R. and FULKERSON, D.R. (1958) Constructing maximal dynamic flows from static flows. Operations Research 6, 419- 433.
-
FORD, L.R. and FULKERSON, D.R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ.
-
GALLO, G. and PALLOTTINO, S. (1988) Shortest path algorithms. Annals of Operations Research 13, 3-79.