A branch and bound algorithm for maximum likelihood paired comparison ranking
From MaRDI portal
Cited in
(17)- Deriving weights from pairwise comparison ratio matrices: An axiomatic approach
- A branch and bound algorithm for the acyclic subgraph problem
- The median procedure in cluster analysis and social choice theory
- Some probabilistic properties of the nearest adjoining order method and its extensions
- Disentangling relationships in symptom networks using matrix permutation methods
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- Taxicab correspondence analysis
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- Agrégation des similarités : une solution oubliée
- scientific article; zbMATH DE number 3854180 (Why is no real title available?)
- A polyhedral approach to the single row facility layout problem
- 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
- Integer programming in psychology: a review and directions for future research
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
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)
