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

DOI10.1287/opre.22.2.413zbMath0274.90034OpenAlexW2103938550MaRDI QIDQ5183272

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)

Related Items (9)

Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem ⋮ Cluster analysis and mathematical programming ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ Cell formation in manufacturing systems through simulated annealing: An experimental evaluation ⋮ A network flow model for biclustering via optimal re-ordering of data matrices ⋮ Constructing blockmodels: how and why ⋮ 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

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