The two-convex-polygons TSP: A solvable case (Q1367695): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:55, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-convex-polygons TSP: A solvable case |
scientific article |
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
