Pages that link to "Item:Q4048435"

The following pages link to A branch search algorithm for maximum likelihood paired comparison ranking (Q4048435):

Displaying 16 items.

• 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)
• Models for concurrent product and process design (Q1046061) (← links)
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) (← 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)
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming (Q1868100) (← 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)
• An interactive multiobjective programming approach to combinatorial data analysis (Q2511823) (← 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)
• Ranking paired contestants (Q4019188) (← links)