The two-convex-polygons TSP: A solvable case (Q1367695)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The two-convex-polygons TSP: A solvable case |
scientific article; zbMATH DE number 1069650
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-convex-polygons TSP: A solvable case |
scientific article; zbMATH DE number 1069650 |
Statements
The two-convex-polygons TSP: A solvable case (English)
0 references
21 May 1998
0 references
travelling salesman problem
0 references
convex polygon
0 references
dynamic programming
0 references
