Pages that link to "Item:Q4380267"

The following pages link to Linear and circular unidimensional scaling for symmetric proximity matrices (Q4380267):

Displaying 12 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)
• Combinatorial individual differences scaling within the city-block metric (Q1010435) (← links)
• The circumplex: a slightly stronger than ordinal approach. (Q1404968) (← links)
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming (Q1868100) (← links)
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices (Q2248666) (← links)
• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
• Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
• An interactive multiobjective programming approach to combinatorial data analysis (Q2511823) (← links)
• Compact integer-programming models for extracting subsets of stimuli from confusion matrices (Q2511847) (← links)
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)