A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem

Journal of the ACM (JACM)

Volumn 38, Issue 4, 1991, Pages 985-1004

  Balas, Egon ^a   Miller, Donald ^b   Pekny, Joseph ^c   Toth, Paolo ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b DUPONT COMPANY   (United States)

^c PURDUE UNIVERSITY   (United States)

^d UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

assignment; matching; shortest augmenting paths; traveling salesman problem

Indexed keywords

EID: 0000620444     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/115234.115349     Document Type: Article

References (28)

1. BALAS, E. AND TOTH, P. Branch and bound methods. In E. L. Lawler, et al., The Traveling Salesman Problem: A Guided Tour to Combinatorial Optimization. Wiley, New York, 1985.
2. BALINSKI, M. A competitive (dual) simplex method for the assignment problem. Math. Prog. 34 (1986), 125-141.
3. BARR, R. S., GLOVER, F., AND KLINGMAN, D. The alternating basis algorithm for assignment problems. Math. Prog. 13 (1977), 1-13.
4. BERTSEKAS, D. P. A new algorithm for the assignment problem. Math. Prog. 21 (1981), 152-171.
5. BERTSEKAS, D. P., AND CASTANON, D. A. Parallel synchronous and asynchronous implementations of the auction algorithm. Electrical Engineering and Computer Science. MIT, Cambridge, Mass., 1989.
6. BURKARD, R. E. AND DERIGS, U. Assignment and Matching Problems: Solutions Methods with FOTRAN Programs. Springer, Berlin, 1980.
7. CARPANETO, G., AND TOTH, P. Algorithm for the solution of the assignment problem for sparse matrices. Comp. 31 (1983), 83-94.
8. CARPANETO, G., AND TOTH, P. Primal-dual algorithms for the assignment problem. Disc. App. Math., 18 (1987), 137-153.
9. DERIGS, U. The shortest augmenting path method for solving assignment problems-motivation and computational experience. Ann. Op. Res. 4 (1985), 57-102.
10. DIJKSTRA, E. W. A note on two problems in connection with graphs. Numer. Math. 1 (1959), 269-271.
11. EDMONDS, J. AND KARP, R. M. Theoretical improvements in algorithmic efficiency of network flow problems, J. ACM 19 (1972), 248-261.
12. FORD, L. R., AND FULKERSON, D. R. Flow in Networks. Princeton University Press, Princeton, N.J., 1962.
13. GOTTLIEB, A. The NYU ultracomputer-designing an MIMD shared-memory parallel computer. IEEE Trans. Comp. C-32 (1983), 175-189.
14. HATAY, L. Bipartite matching: A computational investigation of parallel algorithms. Department of Operations Research, Southern Methodist University, Dallas, Tex., 1987.
15. JONKERS, R., VOLGENANT, T. Shortest augmenting path algorithm for dense and sparse linear assignment problems. Comp. 38 (1987), 325-390.
16. KEMPA, D., KENNINGTON, J., AND ZAKI, H. Performance characteristics of the Jacobi and Gauss-Seidel versions of the auction algorithm on the Alliant FX18. Report OR-89-008, Mechanical and Industrial Engineering. University of Illinois at Urbana-Champaign, Urbana, Ill., 1989.
17. KENNINGTON, J. AND WANG, Z. Solving dense assignment problems on a shared memory multiprocessor, Technical Report 88-OR-16, Department of Operations Research, Southern Methodist University, Dallas, Tex., October 1988.
18. KINDERVATER, G. A. P., AND LENSTRA, J. K. Parallel computing in combinatorial optimization, Ann. Op. Res. 14 (1988).
19. KUHN, N. W. The Hungarian method for the assignment problem. Nav. Res. Log. Quart. 2 (1955), 83-97.
20. LAWLER. E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
21. MARTELLO, S. AND TOTH, P. Linear assignment problems. Ann. Dis. Math. 31 (1987), 259-282.
22. MCGINNES, L. F. Implementation and testing of a primal-dual algorithm for the assignment problem. Op. Res. 31 (1983), 277-291.
23. MILLER, D. L. AND PEKNY, J. F. Results from a parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Op. Res. Lett. 8 (1989), 129-135.
24. MILLER, D. L., PEKNY, J. F., AND THOMPSON, G. L. Solution of large dense transportation problems using a parallel primal method, MSRR No. 546. Carnegie Mellon University, Pittsburgh, Pa., 1988.
25. PEKNY, J. F., AND MILLER, D. L. A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Report 05-27-88, Engineering Design Research Center, Carnegie Mellon University, Pittsburgh, Pa., 1988.
26. RETTBERG, R. AND THOMAS, R. Contention is no obstacle to shared-memory multiprocessing. Commun. ACM 29 (1986), 1202-1212
27. TARJAN, R. E. Data Structures and Network Algorithms. CBMS Regional Conference Series No. 44, SIAM, New York, 1983.
28. TOMIZAWA, N. On some techniques useful for the solution of transportation network problems. Networks 1 (1971), 173-194.