Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
type: Item
instance of: scholarly article
title: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
zbMATH Open document ID: 0821.90122
DOI: 10.1007/BF02253612
published in: Computing
publication date: 1995-05-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 15B57
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 751367
zbMATH Keywords: subtour patching
zbMATH Keywords: Monge-matrix
zbMATH Keywords: traveling salesman
zbMATH Keywords: assignment
zbMATH Keywords: cyclic permutations
zbMATH Keywords: patching graph
author: Rainer E. Burkard
author: Vladimir G. Deineko
MaRDI profile type: Publication
cites work: Geometric applications of a matrix-searching algorithm
cites work: The optimum assignments and a new heuristic approach for the traveling salesman problem
cites work: A new heuristic for the traveling salesman problem
cites work: Sequence comparison with mixed convex and concave costs
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Q3768703
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Q4120276
cites work: Q3677509
cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
cites work: Q4170156
cites work: Q3932608
description: scientific article; zbMATH DE number 751367