A branch search algorithm for maximum likelihood paired comparison ranking
From MaRDI portal
Publication:4048435
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
- Ranking paired contestants
- 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
- Models for concurrent product and process design
- Disentangling relationships in symptom networks using matrix permutation methods
- Taxicab correspondence analysis
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- 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
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
- An interactive multiobjective programming approach to combinatorial data analysis
This page was built for publication: A branch search 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 Q4048435)
