A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path methods are more efficient than other primal–dual and primal–simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, source of parallelism and computational results are presented.