Maximum likelihood paired-comparison ranking and quadratic assignment

SUMMARY 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.

[1]  John S. Decani.  A branch and bound algorithm for maximum likelihood paired comparison ranking , 1972 .

[2]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[3]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[4]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[5]  W. A. Thompson,et al.  Maximum-likelihood paired comparison rankings. , 1966, Biometrika.

[6]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[7]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[8]  James F. Korsh,et al.  A branch search algorithm for maximum likelihood paired comparison ranking , 1974 .

[9]  B. Gillett,et al.  Modular Allocation Technique (MAT) , 1970 .

[10]  J. P. N. Phillips.  A PROCEDURE FOR DETERMINING SLATER'S i AND ALL NEAREST ADJOINING ORDERS , 1967 .

[11]  N. Mantel.  The detection of disease clustering and a generalized regression approach. , 1967, Cancer research.

[12]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[13]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[14]  P. Slater.  Inconsistencies in a schedule of paired comparisons , 1961 .

[15]  J. Decani,et al.  Maximum likelihood paired comparison ranking by linear programming , 1969 .

[16]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[17]  A. H. Land,et al.  A Problem of Assignment with Inter-Related Costs , 1963 .

[18]  Patrick Slater,et al.  THE ANALYSIS OF PERSONAL PREFERENCES , 1960 .

[19]  J. P. N. Phillips.  A FURTHER PROCEDURE FOR DETERMINING SLATER'S i AND ALL NEAREST ADJOINING ORDERS , 1969 .