Efficient special case algorithms for the n-line planar traveling salesman problem (Q3885551)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient special case algorithms for the n-line planar traveling salesman problem |
scientific article |
Statements
Efficient special case algorithms for the n-line planar traveling salesman problem (English)
0 references
1980
0 references
n-line planar traveling salesman problem
0 references
NP-completeness
0 references
polynomial algorithm
0 references
specific city location
0 references
