Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference14 articles.
1. Dantzig, G. B.: On the shortest route through a network. Man. Sci.6, 187 (1960).
2. Dantzig, G. B., W. O. Blattner and M. R. Rao: All shortest routes from a fixed origin in a graph. In: Théorie des graphes, journées internationales d'étude, Rome, juillet 1966 (V. Rosenstiehl, Hrsg.), S. 85. Paris-New York: 1967.
3. Dijkstra, E. W.: A note on two problems in connection with graphs. Num. Math.1, 269 (1959).
4. Domschke, W.: Kürzeste Wege in Graphen: Algorithmen, Verfahrensvergleiche. (Mathematical Systems in Economics, Heft 2.) Meisenheim/Glan: Hain. 1972.
5. Domschke, W.: Vergleich des Rechenaufwands der “Shortest-Route”-Algorithmen von Ford, Bellman und Dijkstra. Oper. Res.-Verfahren11, 26 (1972).
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Back Matter;Algorithmische Graphentheorie;2004-01-01
2. Graph Algorithms;Algorithms and Complexity;1990
3. Weighted min cost flows;European Journal of Operational Research;1982-10
4. Graphentheoretische Methoden in der Logistik;Vorträge der Jahrestagung 1979 / Papers of the Annual Meeting 1979;1980
5. A branch-and-bound/flow-equilbrium algorithm for the approximate solution of total cost minimization problems in traffic networks;Papers of the Regional Science Association;1979-12