论文信息 - Parallel Asynchronous Hungarian Methods for the Assignment Problem

Parallel Asynchronous Hungarian Methods for the Assignment Problem

In this paper, we discuss the parallel asynchronous implementation of the Hungarian method for solving the classical assignment problem. Multiple augmentations and price rises are simultaneously attempted starting from several unassigned sources and using possibly outdated price and assignment information. The results are then merged asynchronously subject to rather weak compatibility conditions. We show the validity of this algorithm and we demonstrate computationally that an asynchronous implementation is often faster than its synchronous counterpart. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Dimitri P. Bertsekas | David A. Castañón | D. Bertsekas | D. Castañón

[1] Marshall Hall,et al. An Algorithm for Distinct Representatives , 1956 .

[2] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3] Dimitri P. Bertsekas,et al. A new algorithm for the assignment problem , 1981, Math. Program..

[4] M. Engquist. A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[5] Leon F. McGinnis,et al. Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..

[6] Ulrich Derigs,et al. The shortest augmenting path method for solving assignment problems — Motivation and computational experience , 1985 .

[7] Darwin Klingman,et al. Threshold assignment algorithm , 1986 .

[8] Paolo Toth,et al. Algorithms and codes for the assignment problem , 1988 .

[9] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[10] Egon Balas,et al. A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .

[11] Dimitri P. Bertsekas,et al. Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..