Science Fair Project Encyclopedia
Bottleneck traveling salesman problem
(Redirected from Bottleneck traveling salesman)
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.
Related topics
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details