| Article ID: | iaor1988253 |
| Country: | Switzerland |
| Volume: | 13 |
| Start Page Number: | 193 |
| End Page Number: | 233 |
| Publication Date: | Nov 1988 |
| Journal: | Annals of Operations Research |
| Authors: | Martello Silvano, Carpaneto Girogio, Toth Paolo |
| Keywords: | computational analysis |
This paper analyzes the most efficient algorithms for the Linear Min-Sum Assignment Problem and shows that they derive from a common basic procedure. For each algorithm, we evaluate the computational complexity and the average performance on randomly-generated test problems. Efficient FORTRAN implementations for the case of complete and sparse matrices are given.