The parallel complexity of TSP heuristics (Q4729351)
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 4114010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parallel complexity of TSP heuristics |
scientific article; zbMATH DE number 4114010 |
Statements
The parallel complexity of TSP heuristics (English)
0 references
1989
0 references
parallel complexity
0 references
traveling salesman
0 references
heuristic algorithms
0 references
0.9209897
0 references
0.8968996
0 references
0.87933797
0 references
0.8782112
0 references
0.8775643
0 references
