 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization.
It is stated as follows: Find the Hamiltonian cycle in a weighted graph with the minimal length of the longest edge.
The problem is known to be NP-hard.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
