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 ...

Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a ...

The travelling salesman problem is of fundamental interest to mathematicians and physicists, and has a number of practical applications, such as computer design. At first sight, the related travelling ...

The science of computational complexity aims to solve the TSP -- the Travelling Salesman Problem -- when the time required to find an optimal solution is vital for practical solutions to modern-day ...