A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures.
Mayiz B. HabbalHaris N. KoutsopoulosSteven R. LermanPublished in: Transp. Sci. (1994)
Keyphrases
- massively parallel
- decomposition algorithm
- shortest path problem
- computer architecture
- parallel computing
- high performance computing
- shortest path
- parallel computers
- decomposition method
- fine grained
- directed graph
- combinatorial optimization problems
- pairwise
- multiple objectives
- computing systems
- parallel machines
- recognition algorithm
- directed acyclic graph
- shared memory
- computer systems
- genetic algorithm
- optimization problems