A note on the traveling salesman problem (Q1116903)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the traveling salesman problem |
scientific article |
Statements
A note on the traveling salesman problem (English)
0 references
1989
0 references
We observe that (i) the problem of recognizing instances of the traveling salesman problem for which the subtour relaxation has an integer optimal solution is NP-complete and (ii) there is no nontrivial upper bound on the `relative error' with which the optimal value of the TSP is approximated by the optimal value of its subtour relaxation.
0 references
complexity
0 references
traveling salesman
0 references
subtour relaxation
0 references
