Parallel shortest augmenting path algorithm for the assignment problem. Technical report
We describe a parallel version of the shortest augmenting path algorithm for the assignment problem. While generating the initial dual solution and partial assignment in parallel does not require substantive changes in the sequential algorithm, using several augmenting paths in parallel does require a new dual variable recalculation method. The parallel algorithm was tested on a 14-processor Butterfly Plus computer, on problems with up to 900 million variables. The speedup obtained increases with problem size. The algorithm was also embedded into a parallel branch and bound procedure for the traveling salesman problem on a directed graph, which was tested on the Butterfly Plus on problems involving up to 7,500 cities. To our knowledge, these are the largest assignment problems and traveling salesman problems solved so far.
- Research Organization:
- Carnegie-Mellon Univ., Pittsburgh, PA (United States). Graduate School of Industrial Administration
- OSTI ID:
- 5658963
- Report Number(s):
- AD-A-233588/3/XAB; CNN: N00014-85-K-0198; NSF-ECS86-01660
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tight upper bound for the speed-up of parallel best-first branch-and-bound algorithms. Technical report
Shortest path in complete bipartite digraph problem and it applications