Bottleneck traveling salesman problem

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

• Travelling salesman problem