Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters |
scientific article |
Statements
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (English)
0 references
11 February 2020
0 references
generalized traveling salesman problem
0 references
polynomial-time approximation scheme
0 references
polynomial-time solvable subclass
0 references
0 references
0 references
0 references
0 references
0 references
