An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices |
scientific article |
Statements
An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (English)
0 references
1 December 1994
0 references
bottleneck traveling salesman
0 references
Hamiltonian tour
0 references
complete weighted digraph
0 references
0 references
0 references
0 references
