Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
type: Item
instance of: scholarly article
title: Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
zbMATH Open document ID: 0479.62059
DOI: 10.1007/BF02293800
author: R. G. Golledge
author: Lawrence Hubert
published in: Psychometrika
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 62J15
Mathematics Subject Classification ID: 62-07
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 62P15
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 3753893
zbMATH Keywords: proximity matrix
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: quadratic assignment
zbMATH Keywords: cubic assignment
MaRDI profile type: Publication
cites work: A Dynamic Programming Formulation with Diverse Applications
cites work: MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: The sequencing of “related” jobs
cites work: A branch search algorithm for maximum likelihood paired comparison ranking
cites work: A Review of the Placement and Quadratic Assignment Problems
cites work: Q4148820
cites work: Completely nonmetric multidimensional scaling
cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES
cites work: Hierarchical clustering schemes
cites work: Some Simple Applications of the Travelling Salesman Problem
cites work: Q4193321
cites work: Q4144192
cites work: Q3898496
cites work: The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
cites work: Q5670102
description: scientific article; zbMATH DE number 3753893