TSP race: minimizing completion time in time-sensitive applications (Q319282)
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 race: minimizing completion time in time-sensitive applications |
scientific article; zbMATH DE number 6633485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | TSP race: minimizing completion time in time-sensitive applications |
scientific article; zbMATH DE number 6633485 |
Statements
TSP race: minimizing completion time in time-sensitive applications (English)
0 references
6 October 2016
0 references
computation-implementation parallelization
0 references
heuristic
0 references
TSP race
0 references
0 references
0 references
0 references
0.8751223
0 references
0.8665364
0 references
0.8623407
0 references
0.8565513
0 references
0.8516015
0 references
0.8506461
0 references
0.8429247
0 references
0.84287584
0 references
0.84287584
0 references
