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

DOI10.1287/OPRE.22.2.413MaRDI QIDQ5183272zbMATH OpenOpenAlexFDO

Authors Jan Karel Lenstra

Publication date 1974

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.22.2.413

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(9)

• Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
• Constructing blockmodels: how and why
• Cluster analysis and mathematical programming
• An experimental comparison of seriation methods for one-mode two-way data
• Stepwise decomposition approaches for large scale cell formation problems
• Seriation and matrix reordering methods: An historical overview
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
• A network flow model for biclustering via optimal re-ordering of data matrices

This page was built for publication: Technical Note—Clustering a Data Array and the Traveling-Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5183272)