A note on a new variant of Murty's ranking assignments algorithm
Marta Pascoal, M. Eugénia Captivo, João Clı́maco · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · 2003
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. © 2003 Springer-Verlag Berlin/Heidelberg.