TSP heuristics: domination analysis and complexity (Q1566378)
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: TSP heuristics: domination analysis and complexity |
scientific article; zbMATH DE number 1922433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | TSP heuristics: domination analysis and complexity |
scientific article; zbMATH DE number 1922433 |
Statements
TSP heuristics: domination analysis and complexity (English)
0 references
2 June 2003
0 references
Domination analysis
0 references
Approximation algorithms
0 references
Traveling salesman problem
0 references
Computational complexity
0 references
