The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 633500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The convex-hull-and-line traveling salesman problem: A solvable case |
scientific article; zbMATH DE number 633500 |
Statements
The convex-hull-and-line traveling salesman problem: A solvable case (English)
0 references
5 September 1994
0 references
shortest path
0 references
well-solvable case
0 references
polynomial time algorithm
0 references
Euclidean traveling salesman
0 references
0.919923722743988
0 references
0.8719220161437988
0 references
0.8390333652496338
0 references
0.8301645517349243
0 references
