| Article ID: | iaor20051088 |
| Country: | Germany |
| Volume: | 1 |
| Issue: | 3 |
| Start Page Number: | 243 |
| End Page Number: | 255 |
| Publication Date: | Jan 2003 |
| Journal: | 4OR |
| Authors: | Captivo M.E., Clmaco J., Pascoal M.M.B. |
In this paper a variant of Murty's algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice.