zbMATH — the first resource for mathematics

A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs. (English) Zbl 0502.90083
90C35 Programming involving graphs or networks
05C35 Extremal problems in graph theory
Full Text: DOI
[1] Berge, C.; Chouila-Houri, A., Programming, games and transportation networks, (1965), Methuen London
[2] Dantzig, G.B., On the shortest route through a network, Management sci., 6, 187-190, (1960) · Zbl 0995.90518
[3] Dantzig, G.B., Linear programming and extensions, (1963), Princeton University Press Princeton, NJ · Zbl 0108.33103
[4] Dijkstra, E.W., A note on two problems in connection with graphs, Numer. math., 1, 269-271, (1959) · Zbl 0092.16002
[5] Dreyfus, S.E., An appraisal of some shortest-path algorithms, Operations res., 17, 395-412, (1969) · Zbl 0172.44202
[6] Dreyfus, S.E.; Law, A.M., The art and theory of dynamic programming, (1977), Academic Press New York · Zbl 0359.90032
[7] Nicholson, T.A.J., Finding the shortest route between two points in a network, Comput. J., 9, 275-280, (1966) · Zbl 0156.18107
[8] Whitehouse, G.E., Systems analysis and design using networks techniques, (1973), Prentice-Hall Englewood Cliffs, NJ · Zbl 0342.90020
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.