Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms (Q1061620)
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: Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms |
scientific article; zbMATH DE number 3912134
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms |
scientific article; zbMATH DE number 3912134 |
Statements
Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms (English)
0 references
1983
0 references
Efficient lower bounds for the complexity are proposed for a wide range of algorithms of solution of discrete optimization problems of the traveling salesman type.
0 references
nonpolynomial lower bounds
0 references
computational complexity
0 references
discrete optimization
0 references
traveling salesman
0 references
