A generalized insertion algorithm for the seriation problem

DOI10.1016/0895-7177(94)90040-XzbMath0814.68066MaRDI QIDQ1328867

Michel Gendreau, Gilbert Laporte, Alain Hertz

Publication date: 8 August 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

traveling salesperson problemarcheology

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of data (68P99)

Related Items

Talent hold cost minimization in film production, Using tabu search for solving a dynamic multi-terminal truck dispatching problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• Incidence matrices and interval graphs
• Solving a family of permutation problems on 0-1 matrices
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• A Dynamic Programming Formulation with Diverse Applications
• SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
• Computer Solutions of the Traveling Salesman Problem