Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
From MaRDI portal
Publication:1868100
DOI10.1006/jmps.2002.1423zbMath1031.90041OpenAlexW2030381873MaRDI QIDQ1868100
Publication date: 27 April 2003
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmps.2002.1423
Related Items (5)
Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial data analysis: Association and partial association
- Generalized concordance
- Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
- The comparison and fitting of given classification schemes
- An interactive multiobjective programming approach to combinatorial data analysis
- Combinatorial Data Analysis
- A branch search algorithm for maximum likelihood paired comparison ranking
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
- Generalized proximity function comparisons
- Linear and circular unidimensional scaling for symmetric proximity matrices
- The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
- Maximum likelihood paired comparison ranking by linear programming
This page was built for publication: Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
