文件名称：Murty's Algorithm
文件大小：304KB
文件格式：PDF
更新时间：2016-10-03 22:56:56
Murty, Algorithm, Assignment
This paper describes an efficient algorithm for such a ranking of all the assignments. The maximum computational effort required to generate an additional assignment in the sequence is that of solving at most (n-i) different assignment problems, one each of sizes 2, 3, . .., n.