Pages that link to "Item:Q1162090"

The following pages link to Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090):

Displaying 8 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)
• 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)
• An interactive multiobjective programming approach to combinatorial data analysis (Q2511823) (← links)
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
• An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction (Q5077898) (← links)