The seriation problem and the travelling salesman problem

DOI10.1016/0771-050X(78)90024-4zbMath0393.90058MaRDI QIDQ1252153

Gilbert Laporte

Publication date: 1978

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Travelling Salesman ProblemCombinatorial ProblemsExact AlgorithmSeriation Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Genetics and epigenetics (92D10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Talent hold cost minimization in film production

Cites Work

• Unnamed Item
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• A Dynamic Programming Formulation with Diverse Applications
• Integer programming approaches to the travelling salesman problem
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Construction of TernaryH_v-groups and TernaryP-hyperoperations
• An Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• A Theorem on Symmetric Traveling Salesman Problems
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: The seriation problem and the travelling salesman problem