Pages that link to "Item:Q1868100"

The following pages link to Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming (Q1868100):

Displaying 5 items.

• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
• A review of multiobjective programming and its application in quantitative psychology (Q645494) (← 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)
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)