The Convex-hull-and-k-line Travelling Salesman Problem
type: Item
instance of: scholarly article
title: The Convex-hull-and-k-line Travelling Salesman Problem
zbMATH Open document ID: 0900.68326
DOI: 10.1016/0020-0190(96)00125-1
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 984195
zbMATH Keywords: Travelling salesman problem
zbMATH Keywords: Polynomial algorithm
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Combinatorial optimization
author: Vladimir G. Deineko
author: Gerhard J. Woeginger
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00125-1
OpenAlex ID: W2101116363
cites work: Efficient special case algorithms for the n-line planar traveling salesman problem
cites work: The convex-hull-and-line traveling salesman problem: A solvable case
cites work: The Traveling-Salesman Problem
cites work: Q3768703
cites work: Q3677509
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: The n-line traveling salesman problem
Recommended article: A generalization of the convex-hull-and-line traveling salesman problem
Recommended article: The convex-hull-and-line traveling salesman problem: A solvable case
Recommended article: The n-line traveling salesman problem
Recommended article: The Traveling Salesman Problem for Lines, Balls, and Planes
Recommended article: The traveling salesman problem on a graph and some related integer polyhedra
Recommended article: The traveling salesmanpProblem for lines in the plane
Recommended article: The Traveling Salesman Problem for Lines, Balls and Planes
Recommended article: Solving the \(k\)-best traveling salesman problem
Recommended article: THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE
description: scientific article; zbMATH DE number 984195