Classification by ordering a (sparse) matrix: A ``simulated annealing approach

DOI10.1016/0307-904X(88)90027-3zbMath0637.62061OpenAlexW2017997986MaRDI QIDQ1098521

B. George

Publication date: 1988

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(88)90027-3

zbMATH Keywords

classificationsimulated annealingsubsystemssparse matrixtravelling salesmancircularly connected matricesidentifying subsystem structurereordering algorithmsimilarity/interaction data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Operations research and management science (90B99)

Related Items (1)

Methods for the one-dimensional space allocation problem

Cites Work

• Optimization by Simulated Annealing
• An algorithm for reducing the moment of inertia of a system interaction matrix
• Identification and analysis of the subsystem structure of models
• Multidimensional Scaling, Tree-Fitting, and Clustering
• Unnamed Item
• Unnamed Item

This page was built for publication: Classification by ordering a (sparse) matrix: A ``simulated annealing approach