Technical Note—Clustering a Data Array and the Traveling-Salesman Problem

J. K. Lenstra
Additional contact information
J. K. Lenstra: Mathematisch Centrum, Amsterdam, The Netherlands

Operations Research, 1974, vol. 22, issue 2, 413-414

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.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.2.413 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:22:y:1974:i:2:p:413-414

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().