上传者: u012119201
|
上传时间: 2022-07-11 15:06:31
|
文件大小: 304KB
|
文件类型: PDF
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.