An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075)
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: An efficient heuristic algorithm for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 5681689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient heuristic algorithm for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 5681689 |
Statements
An efficient heuristic algorithm for the bottleneck traveling salesman problem (English)
0 references
15 March 2010
0 references
bottleneck problems
0 references
traveling salesman problem
0 references
experimental analysis
0 references
combinatorial optimization
0 references
0 references
0 references
0.94021004
0 references
0.94021004
0 references
0.91931176
0 references
0.9093173
0 references
0.90523547
0 references
0.9024966
0 references
0.9000417
0 references
