A multiple pairs shortest path algorithm

Transportation Science

Volumn 39, Issue 4, 2005, Pages 465-476

  Wang, I Lin ^a   Johnson, Ellis L ^b   Sokol, Joel S ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b Georgia Institute of Technology   (United States)

Author keywords

Algebraic method; Carr 's algorithm; LU decomposition; Multiple pairs; Shortest path

Indexed keywords

COMPUTATION THEORY; MOTION PLANNING; PROBLEM SOLVING; TOPOLOGY;

ALGEBRAIC METHOD; CARRÉ'S ALGORITHMS; LU DECOMPOSITION; MULTIPLE PAIRS; SHORTEST PATH;

ALGORITHMS;

EID: 28244438100     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1050.0124     Document Type: Article

References (37)

1. Aho, A. V., J. E. Hopcroft, J. D. Ullman. 1974. The. Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. Ahuja, R. K., K. Mehlhorn, J. B. Orlin, R. E. Tarjan. 1990. Faster algorithms for the shortest path problem. J. ACM 37(2) 213-223.
4. Backhouse, R. C., B. A. Carré. 1975. Regular algebra applied to path finding problems. J. Inst. Math. Appl. 15(2) 161-186.
5. Barnhart, C., E. L. Johnson, C. Hane, G. Sigismondi. 1995. An alternative formulation and solution strategy for multicommodity network flow problems. Telecomm. Systems 3 239-258.
6. Bellman, R. E. 1958. On a routing problem. Quart. Appl. Math. 16 87-90.
7. Bertsekas, D. P., S. Pallottino, M. G. Scutellà. 1995. Polynomial auction algorithms for shortest paths. Comput. Optim. Appl. 4(2) 99-125.
8. Carré, B. A. 1969. A matrix factorization method for finding optimal paths through networks. IEE Conf. Publ. (Comput.-Aided Design), Vol. 51, 388-397.
9. Carré, B. A. 1971. An algebra for network routing problems. J. Inst. Math. Appl. 7 273-294.
10. Cherkassky, B. V., A. V. Goldberg, T. Radzik. 1996. Shortest paths algorithms: Theory and experimental evaluation. Math. Programming 73(2) 129-174.
11. Dantzig, G. B. 1960. On the shortest route through a network. Management Sci. 6 187-190.
12. Dial, R. 1965. Algorithm 360 shortest path forest with topological ordering. Comm. ACM 12 632-633.
13. Dijkstra, E. W. 1959. A note on two problems in connection with graphs. Numerische Mathematik l 269-271.
14. Duff, I. S., A. M. Erisman, J. K. Reid. 1989. Direct Methods for Sparse Matrices. Oxford University Press, New York.
15. Floyd, R. W. 1962. Algorithm 97, shortest path. Comm. ACM 5 345.
16. Ford, L. R., Jr. 1956. Network Flow Theory. The RAND Corp., Santa Monica, CA.
17. Fredman, M. L. 1976. New bounds on the complexity of the shortest path problems. SIAM J. Comput. 5(1) 83-89.
18. Galil, Z., O. Margalit. 1997. All pairs shortest paths for graphs with small integer length edges. J. Comput. System Sci. 54(2) 243-254.
19. Glover, F., R. Glover, D. Klingman. 1984. Computational study of an improved shortest path algorithm. Networks 14(1) 25-36.
20. Goldberg, A. V., T. Radzik. 1993. A heuristic improvement of the Bellman-Ford algorithm. Appl. Matt. Lett. 6(3) 3-6.
21. Goldfarb, D., Z. Jin. 1999. An o(nm)-time network simplex algorithm for the shortest path problem. Oper. Res. 47(3) 445-448.
22. Goldfarb, D., J. Hao, S. R. Kai. 1990. Efficient shortest path simplex algorithms. Oper. Res. 38(4) 624-628.
23. Hu, T. C. 1968. A decomposition algorithm for shortest paths in a network. Oper. Res. 16 91-102.
24. Johnson, E. L. 1972. On shortest paths and sorting. Proc. ACM 25th Annual Conf., 510-517.
25. Markowitz, H. M. 1957. The elimination form of the inverse and its application to linear programming. Management Sci. 3 255-269.
26. Mills, G. 1966. A decomposition algorithm for the shortest-route problem. Oper. Res. 14 279-291.
27. Moore, E. F. 1957. The shortest path through a maze. Proc. Internat. Sympos. Theory Switching, Part II. The Annals of the Computation Laboratory of Harvard University, Harvard University, Cambridge, MA, 285-292.
28. Nakamori, M. 1972. A note on the optimality of some all-shortest path algorithms. J. Oper. Res. Soc. Japan 15(4) 201-204.
29. Pallottino, S. 1984. Shortest-path methods: Complexity, interrelations and new propositions. Networks 14 257-267.
30. Pallottino, S., M. G. Scutellà. 1997. Dual algorithms for the shortest path tree problem. Networks 29(2) 125-133.
31. Pape, U. 1974. Implementation and efficiency of Moore algorithms for the shortest root problem. Math. Programming 7 212-222.
32. Rose, D. J., R. E. Tarjan. 1978. Algorithmic aspects of vertex elimination on directed graphs. SIAM J. Appl. Math. 34(1) 176-197.
33. Seidel, R. 1995. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. System Sci. 51(3) 400-103.
34. Takaoka, T. 1992. A new upper bound on the complexity of the all pairs shortest path problem. Inform. Processing Lett. 43(4) 195-199.
35. Wang, I. L. 2005. On implementation of new multiple shortest paths algorithms. Technical Report NCKU-IIM-001, Dept. of Industrial and Information Management, National Cheng Kung University.
36. Warshall, S. 1962. A theorem on Boolean matrices. J. ACM 9 11-12.
37. Zwick, U. 1998. All pairs shortest paths in weighted directed graphs - Exact and almost exact algorithms. Proc. 39th Annual IEEE Sympos. Foundations Comput. Sci., Palo Alto, CA, 310-319.