Pages that link to "Item:Q2260052"

The following pages link to Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052):

Displaying 9 items.

• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
• Branch and bound algorithm for multidimensional scaling with city-block metric (Q1029698) (← links)
• Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
• Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
• An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
• Residual analysis for unidimensional scaling in the <i>L</i>₂-norm (Q5087499) (← links)
• An exact algorithm for the two-mode \(KL\)-means partitioning problem (Q5964470) (← links)