The seriation problem and the travelling salesman problem
type: Item
instance of: scholarly article
title: The seriation problem and the travelling salesman problem
zbMATH Open document ID: 0393.90058
DOI: 10.1016/0771-050X(78)90024-4
author: G. Laporte
published in: Journal of Computational and Applied Mathematics
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 92D10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 3611072
zbMATH Keywords: Travelling Salesman Problem
zbMATH Keywords: Combinatorial Problems
zbMATH Keywords: Exact Algorithm
zbMATH Keywords: Seriation Problem
MaRDI profile type: Publication
cites work: A Dynamic Programming Formulation with Diverse Applications
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: The Traveling Salesman Problem: A Survey
cites work: Construction of TernaryHv-groups and TernaryP-hyperoperations
cites work: Incidence matrices and interval graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Incidence matrices, interval graphs and seriation in archeology
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Integer programming approaches to the travelling salesman problem
cites work: Q4105999
cites work: A Theorem on Symmetric Traveling Salesman Problems
description: scientific article; zbMATH DE number 3611072