The seriation problem and the travelling salesman problem

DOI10.1016/0771-050X(78)90024-4MaRDI QIDQ1252153zbMATH OpenFDO

Authors G. Laporte

Publication date 1978

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

Full work available at URL https://doi.org/10.1016/0771-050X(78)90024-4

zbMATH Keywords

Combinatorial ProblemsExact AlgorithmSeriation ProblemTravelling Salesman Problem

Mathematics Subject Classification ID

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

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• A Dynamic Programming Formulation with Diverse Applications
• A Theorem on Symmetric Traveling Salesman Problems
• An Algorithm for the Traveling Salesman Problem
• Construction of ternary H_v-groups and ternary P-hyperoperations.
• scientific article; zbMATH DE number 3529639 (Why is no real title available?)
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Integer programming approaches to the travelling salesman problem
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• The Traveling Salesman Problem: A Survey
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(1)

• Talent hold cost minimization in film production

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

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