ABSTRACT
<p><b>Abstract</b>—We introduce a new two-phase technique to solve highly asymmetric assignment problems. In the first phase, the assignment problem is decomposed into subproblems which are solved in parallel. The first phase is used to exclude certain suboptimal assignments from consideration in the second phase. In the second phase, the optimal assignment is finalized. We show that the two-phase algorithm can reduce the theoretical time bound for solving an <tmath>$n \times k$</tmath> assignment problem (<tmath>$n < k$</tmath>) by a factor of <tmath>$\sqrt{\frac{k}{n}}$</tmath>.</p>
INDEX TERMS
Computational optimization, linear network flow, mathematical programming, parallel algorithm.
CITATION
Jack Brassil, Natalya Cohen, "A Parallel Pruning Technique for Highly Asymmetric Assignment Problems", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 550-558, June 2000, doi:10.1109/71.862206
CITATIONS
SHARE
90 ms
(Ver 3.3 (11022016))