The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

This is a preview. Log in through your library . Abstract We motivate, derive, and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens ...

This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch-and-bound algorithms for this problem can benefit from it. The bound is ...