Difference between BTSP and TSP I am wondering what is the difference between Bottleneck Travelling Salesman Problem and normal Travelling Salesman Problem?

Thank you
BTSP asks to find a Hamiltonian cycle in a weighted graph, which minimizes the weight of its most weighty edge.

TSP asks to find a Hamiltonian cycle in a weighted graph, which minimizes the sum of weights of its edges.