A branch search algorithm for maximum likelihood paired comparison ranking

DOI10.1093/biomet/61.3.621zbMath0295.62078OpenAlexW1967557914MaRDI QIDQ4048435

John A. Flueck, James F. Korsh

Publication date: 1974

Published in: Biometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/biomet/61.3.621

Mathematics Subject Classification ID

Paired and multiple comparisons; multiple testing (62J15) Algorithms in computer science (68W99)

Related Items (16)

Some probabilistic properties of the nearest adjoining order method and its extensions ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Ranking paired contestants ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation ⋮ The median procedure in cluster analysis and social choice theory ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Taxicab correspondence analysis ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Models for concurrent product and process design ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming

This page was built for publication: A branch search algorithm for maximum likelihood paired comparison ranking