Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033)
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: Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient |
scientific article; zbMATH DE number 3511862
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient |
scientific article; zbMATH DE number 3511862 |
Statements
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (English)
0 references
1976
0 references
