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.