Other approaches include: Various branch-and-bound algorithms, which can be used to process TSPs containing 40–60 cities. Solution of a TSP with 7 cities using a simple Branch and bound algorithm. The ...

This algorithm is faster than the original r-optimal method, and computation times increase much less rapidly with problem size. The new algorithm makes it possible to solve large-scale travelling ...