A note on a new variant of Murty's ranking assignments algorithm (Q1416101)

The ranking assignments problem is a generalization of a well-known assignment problem [\textit{H. W. Kuhn}, ''The Hungarian method for the assignment problem''. Metody Algoritmy Resheniya Transportnoi Zadachi 1, 35--52 (1963); translation from Naval Res. Logist. Quart. 2, 83--97 (1955; Zbl 0143.41905)]. The aim is to compute the \(K\) least cost assignments. In the present paper, the two algorithms for solving the ranking assignments problem are reviewed [\textit{K. G. Murty}, ''An algorithm for ranking all the assignments in incerasing order of cost''. Oper. Res. 16, 682--687 (1968; Zbl 0214.18705)] and [\textit{C. R. Chegireddy, H. W. Hamacher}, ''Algorithms for finding K-best perfect matchings''. Discrete Appl. Math. 18, 155--165 (1987; Zbl 0621.05026)] and a new variant of Murty's algorithm is proposed. Computational results are presented which show that the behaviour of the new variant is better in practice than Murty's algorithm.