Maximum likelihood paired-comparison ranking and quadratic assignment
最大似然成对比较排序与二次指派
A connexion is identified between maximum likelihood paired-comparison ranking and the problem of quadratic assignment discussed in the operational research literature. This relationship immediately gives a set of computational techniques for obtaining the necessary rankings, and, in addition, provides a general framework for testing the reasonableness of particular object sequencings suggested a priori.