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 important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...

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

Forget GPS. With no fancy maps or even brains, immune system cells can solve a simple version of the traveling salesman problem, a computational conundrum that has vexed mathematicians for decades.