Paper Info
Title
Technical Note-Clustering a Data Array and the Traveling-Salesman Problem
Abstract
A clustering of a nonnegative M×N array is obtained by permuting its rows and columns. W. T. McCormick et al. [Opns. Res. 20, 993-1009 1972] measure the effectiveness of a clustering by the sum of all products of nearest-neighbor elements in the permuted array. This note points out that this clustering problem can be stated as two traveling-salesman problems.
Year
DOI
Venue
1974
10.1287/opre.22.2.413
Operations Research
Keywords
Field
DocType
traveling salesman problem
Row and column spaces,Mathematical optimization,Technical note,Permutation,Algorithm,Travelling salesman problem,Array data type,Cluster analysis,Mathematics
Journal
Volume
Issue
Citations 
22
2
7
PageRank 
References 
Authors
1.52
0
1
Name
Order
Citations
PageRank
J. K. Lenstra11689329.39