A branch and bound algorithm for maximum likelihood paired comparison ranking
From MaRDI portal
Publication:5657533
DOI10.1093/biomet/59.1.131zbMath0245.62037OpenAlexW2091389549MaRDI QIDQ5657533
Publication date: 1972
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/59.1.131
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 ⋮ Deriving weights from pairwise comparison ratio matrices: An axiomatic approach ⋮ Unnamed Item ⋮ A polyhedral approach to the single row facility layout problem ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ A branch and bound algorithm for the acyclic subgraph problem ⋮ 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 ⋮ Agrégation des similarités : une solution oubliée
This page was built for publication: A branch and bound algorithm for maximum likelihood paired comparison ranking
