Step6: Bottleneck traveling salesman problem

             The bottleneck traveling salesman problem is where we want to minimize the largest edge cost in the tour instead of the total cost. That is, we want to minimize the maximum distance the salesman travels between any two adjacent cities.

#Reference:

1. http://en.wikipedia.org/wiki/Bottleneck_traveling_salesman_problem

2. http://link.springer.com/chapter/10.1007%2F978-3-642-15369-3_1

3. http://link.springer.com/article/10.1007%2Fs12597-009-0018-x