Parallel asynchronous algorithms for the K shortest paths problem

Journal of Optimization Theory and Applications

Volumn 104, Issue 1, 2000, Pages 91-108

  Guerriero, F ^a   Musmanno, R ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF SALENTO   (Italy)

Author keywords

K shortest paths problems; Label correcting methods; Nonuniform memory access (NUMA) multiprocessor; Parallel asynchronous algorithms; Shared memory

Indexed keywords

MEMORY ARCHITECTURE; MULTIPROCESSING SYSTEMS; NUMERICAL METHODS;

ASYNCHRONOUS ALGORITHMS; K SHORT PATH PROBLEM; K SHORTEST PATH; LABEL-CORRECTING; LABEL-CORRECTING METHOD; NONUNIFORM MEMORY ACCESS; NONUNIFORM MEMORY ACCESS MULTIPROCESSOR; PARALLEL ASYNCHRONOI ALGORITHM; SHARED MEMORY; SHORTEST PATH PROBLEM;

DIRECTED GRAPHS;

EID: 0034349447     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004676705907     Document Type: Article

References (14)

1. 1. MIAOU, S. P., and CHIN, S. M., Computing K Shortest Paths for Nuclear Spent Fuel Highway Transportation, European Journal of Operational Research, Vol. 53, pp. 64-80, 1991.
2. 2. CARLIER, J., LI, Y., and LUTTON, J. L., Reliability Evaluation of Large Telecommunication Networks, Discrete Applied Mathematics, Vol. 76, pp. 61-80, 1997.
3. 3. SUBRAMANIAN, S., Routing Algorithms for Dynamic, Intelligent Transportation Networks, MS Thesis, University of Virginia, 1997.
4. 4. RUPPERT, E., Parallel Algorithms for the k Shortest Paths and Related Problems, MS Thesis, University of Toronto, 1996.
5. 5. RUPPERT, E., Finding the k Shortest Paths in Parallel, Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, Lubeck, Germany, 1997; Springer Verlag, Berlin, Germany, pp. 475-486, 1997.
6. 6. BERTSEKAS, D. P., GUERRIERO, F., and MUSMANNO, R., Parallel Asynchronous Label-Correcting Methods for Shortest Paths, Journal of Optimization Theory and Applications, Vol. 88, pp. 297-321, 1996.
7. 7. GUERRIERO, F., and MUSMANNO, R., Label-Setting Methods for the K Shortest Paths Problem, Report Parcolab 9/96, Department of Electronics, Informatics, and Systems, University of Calabria, 1996.
8. 8. GUERRIERO, F., LACAGNINA, V., MUSMANNO, R., and PECORELLA, A., Efficient Node Selection Strategies in Label-Correcting Methods for the K Shortest Paths Problem, Report Parcolab 6/96, Department of Electronics, Informatics, and Systems, University of Calabria, 1996.
9. 9. GLOVER, F., GLOVER, R., and KLINGMAN, D., The Threshold Shortest Path Algorithm, Networks, Vol. 14, pp. 256-282, 1986.
10. 10. BERTSEKAS, D. P., A Simple and Fast Label-Correcting Algorithm for Shortest Paths, Networks, Vol. 23, pp. 703-709, 1993.
11. 11. BERTSEKAS, D. P., Linear Network Optimization: Algorithms and Codes, MIT Press, Cambridge, Massachusetts, 1991.
12. 12. BERTSEKAS, D. P., and TSITSIKLIS, J. N., Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
13. 13. 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.
14. 14. GUERRIERO, F., and MUSMANNO, R., Parallel Asynchronous Algorithms for the K Shortest Paths Problem, Report Parcolab 6/98, Department of Electronics, Informatics, and Systems, University of Calabria, 1998.