Pages that link to "Item:Q5657533"
From MaRDI portal
The following pages link to A branch and bound algorithm for maximum likelihood paired comparison ranking (Q5657533):
Displaying 16 items.
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices (Q463122) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Deriving weights from pairwise comparison ratio matrices: An axiomatic approach (Q1107400) (← links)
- A branch and bound algorithm for the acyclic subgraph problem (Q1154950) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- Some probabilistic properties of the nearest adjoining order method and its extensions (Q1339200) (← links)
- Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
- Taxicab correspondence analysis (Q2261028) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
- Agrégation des similarités : une solution oubliée (Q3148380) (← links)
- (Q3322995) (← links)