A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices

DOI10.1007/BF02294996zbMath1297.62226OpenAlexW2022560484MaRDI QIDQ463122

Michael J. Brusco

Publication date: 15 October 2014

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02294996

zbMATH Keywords

seriationcombinatorial optimizationbranch and boundanti-Robinson form

Mathematics Subject Classification ID

Related Items (11)

An optimal algorithm to recognize Robinsonian dissimilarities ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ Modules in Robinson Spaces ⋮ Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming ⋮ Taxicab correspondence analysis ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis

Cites Work

• The approximation of two-mode proximity matrices by sums of order-constrained matrices
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
• 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
• Linear and circular unidimensional scaling for symmetric proximity matrices
• The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• Unnamed Item
• Unnamed Item

This page was built for publication: A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices