A branch and bound algorithm for maximum likelihood paired comparison ranking

DOI10.1093/BIOMET/59.1.131zbMATH Open0245.62037OpenAlexW2091389549MaRDI QIDQ5657533FDOQ5657533

Authors: John S. de Cani 

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

Mathematics Subject Classification ID

Point estimation (62F10) Nonparametric estimation (62G05)

Cited In (16)

• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
• Disentangling relationships in symptom networks using matrix permutation methods
• A polyhedral approach to the single row facility layout problem
• Taxicab correspondence analysis
• Deriving weights from pairwise comparison ratio matrices: An axiomatic approach
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Agrégation des similarités : une solution oubliée
• Title not available (Why is that?)
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• Some probabilistic properties of the nearest adjoining order method and its extensions
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The median procedure in cluster analysis and social choice theory
• A branch and bound algorithm for the acyclic subgraph problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657533)