Pages that link to "Item:Q4101659"

The following pages link to SERIATION USING ASYMMETRIC PROXIMITY MEASURES (Q4101659):

Displaying 24 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)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Generalized concordance (Q1133270) (← links)
• Monotonic models for asymmetric proximities (Q1140059) (← links)
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) (← links)
• The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
• Constructing blockmodels: how and why (Q1245783) (← links)
• New results on the computation of median orders (Q1356737) (← links)
• On solving intransitivities in repeated pairwise choices (Q1377454) (← links)
• The circumplex: a slightly stronger than ordinal approach. (Q1404968) (← links)
• Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming (Q1868100) (← links)
• The reversing number of a digraph (Q1894351) (← links)
• Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
• Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
• Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
• NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← 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 survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• (Q2741281) (← links)
• A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
• Seriation and matrix reordering methods: An historical overview (Q4969706) (← links)