A note on the complexity of the asymmetric traveling salesman problem (Q1374382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the complexity of the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 1094811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of the asymmetric traveling salesman problem |
scientific article; zbMATH DE number 1094811 |
Statements
A note on the complexity of the asymmetric traveling salesman problem (English)
0 references
4 December 1997
0 references
average-case complexity
0 references
asymmetric traveling salesman
0 references
branch-and-bound
0 references
subtour elimination
0 references
0 references
