An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3858879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for the Bottleneck Traveling Salesman Problem |
scientific article; zbMATH DE number 3858879 |
Statements
An Algorithm for the Bottleneck Traveling Salesman Problem (English)
0 references
1984
0 references
bottleneck traveling salesman problem
0 references
directed Hamiltonian circuit
0 references
lower bounds
0 references
Bottleneck Assignment
0 references
Bottleneck Arborescence
0 references
breadth- first branch and bound algorithm
0 references
heuristic search
0 references
test problems
0 references
computational result
0 references
0.8894187211990356
0 references
0.8489194512367249
0 references
0.8463541865348816
0 references
0.8206024169921875
0 references
