Basically, the algorithm just does a binary search over all
possible lengths of the optimal tour, going from 0 to the sum of
all distances. Note that binary search is necessary here and we
can't just increment the value of b by
1 each time since the sum of all distances is exponential in the
size of the input.