Free Access

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

J. K. Lenstra
J. K. Lenstra
Mathematisch Centrum, Amsterdam, The Netherlands
Search for more papers by this author

J. K. Lenstra

Mathematisch Centrum, Amsterdam, The Netherlands

Search for more papers by this author

Published Online:1 Apr 1974https://doi.org/10.1287/opre.22.2.413

Cited by
- Improved Visual Saliency of Graph Clusters with Orderable Node-Link Layouts
  IEEE Transactions on Visualization and Computer Graphics, Vol. 31, No. 1
- A Niching Regression Adaptive Memetic Algorithm for Multimodal Optimization of the Euclidean Traveling Salesman Problem
  IEEE Transactions on Evolutionary Computation, Vol. 27, No. 5
- On the Convergence of an Efficient and Robust Dynamic Neural Network Concept with Application to Solving Traveling Salesman Problems
  31 December 2022 | WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS, Vol. 21
- Parallelizing the all-nearest-neighbor algorithm for Travelling Salesman Problem
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
  14 February 2021
- Didactic Visualization of Routing Problems
  21 June 2020 | Education Sciences, Vol. 10, No. 6
- Eyeing the patterns: Data visualization using doubly-seriated color heatmaps
- A data privacy preservation approach and a case study in data analytics
- Flexible partitioning for selective binary theta-joins in a massively parallel setting
  20 November 2017 | Distributed and Parallel Databases, Vol. 36, No. 2
- Symmetric Travelling Salesman Problem
  28 November 2018
- An experimental comparison of seriation methods for one-mode two-way data
  European Journal of Operational Research, Vol. 257, No. 1
- Matrix Reordering Methods for Table and Network Visualization
  4 July 2016 | Computer Graphics Forum, Vol. 35, No. 3
- Path Planning for Process Modelling in Chemical Engineering
- Novel Biclustering Methods for Re-ordering Data Matrices
  20 July 2012
- On the Nearest Neighbor Algorithms for the Traveling Salesman Problem
- Comparing Clusterings Using Bertin's Idea
  IEEE Transactions on Visualization and Computer Graphics, Vol. 18, No. 12
- Visual matrix explorer for collaborative seriation
  7 September 2011 | WIREs Computational Statistics, Vol. 4, No. 1
- Design of Cellular Manufacturing System Using Non-Traditional Optimization Algorithms
- Solving a practical clustering problem via GTMAS
- A network flow model for biclustering via optimal re-ordering of data matrices
  13 September 2008 | Journal of Global Optimization, Vol. 47, No. 3
- Seriation and matrix reordering methods: An historical overview
  11 March 2010 | Statistical Analysis and Data Mining: The ASA Data Science Journal, Vol. 3, No. 2
- Enhancing molecular discovery using descriptor‐free rearrangement clustering techniques for sparse data sets
  16 September 2009 | AIChE Journal, Vol. 56, No. 2
- Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
  6 January 2009 | Journal of Global Optimization, Vol. 45, No. 1
- The History of the Cluster Heat Map
  The American Statistician, Vol. 63, No. 2
- Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
  27 October 2008 | BMC Bioinformatics, Vol. 9, No. 1
- OPTIMAL METHODS FOR RE-ORDERING DATA MATRICES IN SYSTEMS BIOLOGY AND DRUG DISCOVERY APPLICATIONS
  20 November 2011 | Biophysical Reviews and Letters, Vol. 03, No. 01n02
- Matrix Visualization
- Biclustering of data matrices in systems biology via optimal re-ordering
- seriation: Infrastructure for Ordering Objects Using Seriation
  CRAN: Contributed Packages
- Detecting Community Structure in Complex Networks by Optimal Rearrangement Clustering
- A traveling salesman approach for predicting protein functions
  12 October 2006 | Source Code for Biology and Medicine, Vol. 1, No. 1
- Local search for Hamiltonian Path with applications to clustering visitation paths
  21 December 2017 | Journal of the Operational Research Society, Vol. 55, No. 7
- Generating Nearly Sorted Sequences – The use of measures of disorder
  Electronic Notes in Theoretical Computer Science, Vol. 91
- Matrix Visualization and Information Mining
- Dendrogram Seriation Using Simulated Annealing
  1 June 2003 | Information Visualization, Vol. 2, No. 2
- Clustering in High-Dimensional Data Spaces
- Clustering in High-dimensional Data Spaces
- Recommendation agents on the internet
  Journal of Interactive Marketing, Vol. 14, No. 3
- Genetic algorithm for maximizing the parts flow within cells in manufacturing cell design
  Computers & Industrial Engineering, Vol. 36, No. 2
- Stepwise decomposition approaches for large scale cell formation problems
  European Journal of Operational Research, Vol. 113, No. 1
- A mathematical programming approach to evaluating alternative machine clusters in cellular manufacturing
  International Journal of Production Economics, Vol. 58, No. 3
- Redesigning jobshops to cellular manufacturing systems
  Integrated Manufacturing Systems, Vol. 9, No. 6
- Cell Formation Using Genetic Algorithms
- Cluster analysis and mathematical programming
  Mathematical Programming, Vol. 79, No. 1-3
- The Evolution of Knowledge and the Dynamics of an Industry Network
  Journal of Management & Governance, Vol. 1, No. 2
- Visual heuristics for data clustering
- Measuring cellular manufacturing performance
- Cellular manufacturing: A taxonomic review framework
  Journal of Manufacturing Systems, Vol. 13, No. 3
- Formulation of the machine cell grouping problem with capacity and material movement constraints
  Journal of Manufacturing Systems, Vol. 13, No. 4
- Machine cell formation: using the simulated annealing algorithm
  International Journal of Computer Integrated Manufacturing, Vol. 6, No. 6
- Assignment Model Formulation of the Machine Cell Formation Problem in Cellular Manufacturing
  International Journal of Operations & Production Management, Vol. 13, No. 10
- Blockmodels from the bond energy approach
  Social Networks, Vol. 12, No. 2
- An Optimal Model for Cell Formation Decisions
  7 June 2007 | Decision Sciences, Vol. 21, No. 2
- Some Algorithms for “Bond Energy” Data Analysis, Including Simulated Annealing
- The bond energy algorithm revisited
  IEEE Transactions on Systems, Man, and Cybernetics, Vol. 20, No. 1
- Commonality analysis: A linear cell clustering algorithm for group technology
  30 March 2007 | International Journal of Production Research, Vol. 27, No. 12
- Applying row-column permutation to matrix representations of large citation networks
  Information Processing & Management, Vol. 25, No. 3
- Marketing Applications of Sequencing and Partitioning of Nonsymmetric and/or Two-Mode Matrices
- Models for the process planning problem in flexible manufacturing systems
  The International Journal of Advanced Manufacturing Technology, Vol. 2, No. 2
- A within-cell utilization based heuristic for designing cellular manufacturing systems
  12 March 2007 | International Journal of Production Research, Vol. 25, No. 5
- The part families problem in flexible manufacturing systems
  Annals of Operations Research, Vol. 3, No. 6
- Analysis of integer programming formulations of clustering problems
  Image and Vision Computing, Vol. 2, No. 1
- Blockmodeling complex statutes
  Economics Letters, Vol. 13, No. 1
- Clustering Analysis and Its Applications
- Advances in Archaeological Seriation
- Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems
  1 January 2025 | Psychometrika, Vol. 43, No. 1
- Constructing blockmodels: How and why
  Journal of Mathematical Psychology, Vol. 17, No. 1
- Advances in Archaeological Seriation

Volume 22, Issue 2

March-April 1974

Pages 205-451

Article Information

Metrics

Information

Published Online:April 01, 1974

Cite as

J. K. Lenstra, (1974) Technical Note—Clustering a Data Array and the Traveling-Salesman Problem. Operations Research 22(2):413-414.

https://doi.org/10.1287/opre.22.2.413

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

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

Volume 22, Issue 2

Article Information

Metrics

Information

Cite as

Sign Up for INFORMS Publications Updates and News