The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878)
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: The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis |
scientific article; zbMATH DE number 6650608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis |
scientific article; zbMATH DE number 6650608 |
Statements
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (English)
0 references
10 November 2016
0 references
traveling salesman problem
0 references
bottleneck problems
0 references
experimental analysis
0 references
heuristics
0 references
complexity
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0.9578608
0 references
0.9578608
0 references
0.93019634
0 references
0.9196239
0 references
0.9168775
0 references
0.91527927
0 references
