Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658)
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: Guaranteed performance heuristics for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 3839707
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guaranteed performance heuristics for the bottleneck traveling salesman problem |
scientific article; zbMATH DE number 3839707 |
Statements
Guaranteed performance heuristics for the bottleneck traveling salesman problem (English)
0 references
1984
0 references
bottleneck traveling salesman problem
0 references
constant-performance, polynomial- time, nonexact algorithms
0 references
minimax traveling salesman problem
0 references
biconnected graphs
0 references
heuristic
0 references
worst-case behavior
0 references
computational complexity
0 references
0 references
