The two-convex-polygons TSP: A solvable case (Q1367695): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Efficient special case algorithms for the n-line planar traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The convex-hull-and-line traveling salesman problem: A solvable case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The order of points on the second convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3677509 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The n-line traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3216652 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02568533 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121251584 / rank | |||
Normal rank | |||
Latest revision as of 11:37, 30 July 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
