Parallel asynchronous label-correcting methods for shortest paths

Journal of Optimization Theory and Applications

Volumn 88, Issue 2, 1996, Pages 297-320

  Bertsekas, D P ^a   Guerriero, F ^b   Musmanno, R ^b  

^a USA   (United States)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Label correcting methods; Parallel asynchronous algorithms; Shared memory multiprocessors; Shortest path problems

Indexed keywords

MEMORY ARCHITECTURE; MULTIPROCESSING SYSTEMS;

ASYNCHRONOUS ALGORITHMS; ASYNCHRONOUS VERSION; LABEL-CORRECTING; LABEL-CORRECTING METHOD; PARALLEL ASYNCHRONOI ALGORITHM; SHARED MEMORY MULTIPROCESSOR; SHORT-PATH; SHORTEST PATH PROBLEM; SINGLE ORIGIN; SUPERLINEAR SPEEDUPS;

DIRECTED GRAPHS;

EID: 0030532301     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02192173     Document Type: Article

References (21)

1. GALLO, G., and PALLOTTINO, S., Shortest Path Algorithms, Annals of Operations Research, Vol. 7, pp. 3-79, 1988.
2. BERTSEKAS, D. P., An Auction Algorithm for the Shortest Path Problem, Mathematical Programming Study, Vol. 26, pp. 38-64, 1986.
3. BERTSEKAS, D. P., PALLOTTINO, S., and SCUTELLA', M. G., Polynomial Auction Algorithms for Shortest Paths, Computational Optimization and Applications, Vol. 4, pp. 99-125, 1995.
4. HELGASON, R. V., and STEWART, D., One-to-One Shortest Path Problem: An Empirical Analysis with the Two-Tree Dijkstra Algorithm, Computational Optimization and Applications, Vol. 2, pp. 47-75, 1993.
5. POLYMENAKOS, L., and BERTSEKAS, D. P., Parallel Shortest Path Auction Algorithms, Parallel Computing, Vol. 20, pp. 1221-1247, 1994.
6. GALLO, G., and PALLOTTINO, S., Shortest Path Methods: A Unified Approach, Mathematical Programming Study, Vol. 26, pp. 38-64, 1986.
7. BELLMAN, R., Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.
8. BERTSEKAS, D. P., A Simple and Fast Label-Correcting Algorithm for Shortest Paths, Networks, Vol. 23, pp. 703-709, 1993.
9. GLOVER, F., GLOVER, R., and KLINGMAN, D., The Threshold Shortest Path Algorithm, Networks, Vol. 14, pp. 256-282, 1986.
10. PAPE, U., Implementation and Efficiency of Moore Algorithms for the Shortest Path Problem, Mathematical Programming, Vol. 7, pp. 212-222, 1974.
11. BERTSEKAS, D. P., Linear Network Optimization: Algorithms and Codes, MIT Press, Cambridge, Massachusetts, 1991.
12. BERTSEKAS, D. P., Distributed Dynamic Programming, IEEE Transactions on Automatic Control, Vol. 27, pp. 610-616, 1982.
13. BERTSEKAS, D. P., and GALLAGER, R. G., Data Networks, 2nd Edition, Prentice-Hall, Englewood Cliffs, New Jersey, 1992.
14. BERTSEKAS, D. P., and TSITSIKLIS, J. N., Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
15. MOHR, T., and PASCHE, C., Parallel Shortest Path Algorithm, Computing, Vol. 40, pp. 281-292, 1990.
16. TRAFF, J. L., Precis: Distributed Shortest Path Algorithms, Proceedings of the 5th International PARLE Conference, Munich, Germany, 1993; Springer Verlag, Berlin, Germany, pp. 720-723, 1993.
17. DUNG, T., HAO, J., and KOKUR, G., Label-Correcting Shortest Path Algorithms: Analysis and Implementation, Unpublished Report, GTE Laboratories, Waltham, Massachusetts, 1993.
18. BERTSEKAS, D. P., and CASTANON, D. A., Parallel Asynchronous Implementations of the Auction Algorithm, Parallel Computing, Vol. 1, pp. 707-732, 1991.
19. KLINGMAN, D., NAPIER, A., and STUTZ, J., NETGEN: A Program for Generating Large-Scale (Un) Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems, Management Science, Vol. 20, pp. 814-822, 1974.
20. BERTSEKAS, D. P., GUERRIERO, F., and MUSMANNO, R., Parallel Asynchronous Label-Correcting Methods for Shortest Paths, Report No. LIDS-P-2250, Massachusetts Institute of Technology, 1992.
21. BROWN, A. A., and BARTHOLOMEW-BIGGS, M. C., Some Effective Methods for Unconstrained Optimization Based on the Solution of Systems of Ordinary Differential Equations, Report No. 78, Numerical Optimisation Centre, Hatfield Polytechnic, Hatfield, England, 1987.