Pages that link to "Item:Q2511823"

The following pages link to An interactive multiobjective programming approach to combinatorial data analysis (Q2511823):

Displaying 11 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)
• A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← 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)
• Multiobjective blockmodeling for social network analysis (Q2442107) (← 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)