Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098)
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: Experimental analysis of heuristics for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 6700353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Experimental analysis of heuristics for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 6700353 |
Statements
Experimental analysis of heuristics for the bottleneck traveling salesman problem (English)
0 references
4 April 2017
0 references
traveling salesman problem
0 references
bottleneck TSP
0 references
experimental analysis
0 references
maximum scatter TSP
0 references
heuristic algorithms
0 references
0 references
0 references
0.9144792556762696
0 references
0.8489194512367249
0 references
0.8384722471237183
0 references
0.7859408855438232
0 references
0.7835323214530945
0 references
