Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. Shortest route methods: 1. Reaching, pruning and buckets;Denardo;Operations Research,1979
2. Dial, Algorithm 360: Shortest path forest with topological ordering;Dial;Comm. Assoc. Comput. Mach.,1969
3. An appraisal of some shortest-path algorithms;Dreyfus;Operations Res.,1969
4. A note on two problems in connection with graphs;Dykstra;Numerische Mathematiek,1959
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles;Computers & Industrial Engineering;2014-05
2. Nondecreasing paths in a weighted graph or;ACM Transactions on Algorithms;2010-08
3. Efficient points on a network;Networks;1986
4. Shortest path methods: A unifying approach;Mathematical Programming Studies;1986
5. Shortest Paths in Signed Graphs;Algebraic and Combinatorial Methods in Operations Research, Proceedings of the Workshop on Algebraic Structures in Operations Research;1984