Pages that link to "Item:Q463122"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices (Q463122):
Displaying 15 items.
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Inducing a blockmodel structure of two-mode binary data using seriation procedures (Q856645) (← links)
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis (Q1048653) (← links)
- Integer programming methods for seriation and unidimensional scaling of proximity matrices: A review and some extensions. (Q1566090) (← 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)
- Taxicab correspondence analysis (Q2261028) (← links)
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition (Q2445688) (← links)
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses (Q2483823) (← links)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)
