An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323)
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 \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices |
scientific article; zbMATH DE number 501145
| 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; zbMATH DE number 501145 |
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
