The two-convex-polygons TSP: A solvable case
type: Item
instance of: scholarly article
title: The two-convex-polygons TSP: A solvable case
zbMATH Open document ID: 0888.90143
DOI: 10.1007/BF02568533
author: Javier Tejel
author: Alfredo García
published in: Top
publication date: 1998-05-21T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1069650
zbMATH Keywords: travelling salesman problem
zbMATH Keywords: convex polygon
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
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 order of points on the second convex hull of a simple polygon
cites work: Q3677509
cites work: The n-line traveling salesman problem
cites work: Q3216652
full work available at URL: https://doi.org/10.1007/bf02568533
OpenAlex ID: W2121251584
description: scientific article; zbMATH DE number 1069650