Fat computational complexity and heuristic design for the TSP (Q3054243)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5811231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fat computational complexity and heuristic design for the TSP |
scientific article; zbMATH DE number 5811231 |
Statements
Fat Computational Complexity and Heuristic Design for the TSP (English)
0 references
5 November 2010
0 references
traveling salesman problem
0 references
NP-hard
0 references
heuristic algorithm
0 references
0.7614359259605408
0 references
0.7583015561103821
0 references
0.7544229030609131
0 references
0.7511888146400452
0 references
