Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
From MaRDI portal
Publication:1162090
DOI10.1007/BF02293800zbMath0479.62059MaRDI QIDQ1162090
R. G. Golledge, Lawrence J. Hubert
Publication date: 1981
Published in: Psychometrika (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ 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 ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
- Completely nonmetric multidimensional scaling
- Hierarchical clustering schemes
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- A branch search algorithm for maximum likelihood paired comparison ranking
- Some Simple Applications of the Travelling Salesman Problem
- A Dynamic Programming Formulation with Diverse Applications
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- The sequencing of “related” jobs
- An Appraisal of Some Shortest-Path Algorithms
- A Review of the Placement and Quadratic Assignment Problems
This page was built for publication: Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation