BRANCH SEARCH ALGORITHM FOR MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING

被引：28

作者：

FLUECK, JA ^{[1
]}

KORSH, JF ^{[1
]}

机构：

[1] TEMPLE UNIV,DEPT STATISTICS,PHILADELPHIA,PA 19122

来源：

关键词：

D O I：

10.2307/2334748

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：621 / 626

页数：6

共 9 条

[1] MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING BY LINEAR PROGRAMMING
DECANI, JS
[J]. BIOMETRIKA, 1969, 56 (03) : 537 - &
[2] DECANI JS, 1972, BIOMETRIKA, V59, P131
[3] FLUECK JA, TO BE PUBLISHED
[4] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[5] REDUCTION ALGORITHM FOR ZERO-ONE SINGLE KNAPSACK PROBLEMS
INGARGIOLA, GP
KORSH, JF
[J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1973, 20 (04): : 460 - 463
[6] A PROCEDURE FOR DETERMINING SLATERS I AND ALL NEAREST ADJOINING ORDERS
PHILLIPS, JP
[J]. BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 1967, 20 : 217 - &
[7] MAXIMUM-LIKELIHOOD PAIRED COMPARISON RANKINGS
REMAGE, R
THOMPSON, WA
[J]. BIOMETRIKA, 1966, 53 : 143 - &
[8] SLATER P, 1961, BIOMETRIKA, V48, P303
[9] RANKINGS FROM PAIRED COMPARISONS
THOMPSON, WA
REMAGE, R
[J]. ANNALS OF MATHEMATICAL STATISTICS, 1964, 35 (02): : 739 - &