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.

Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem (ATSP), based on the assignment problem (AP) relaxation, have been proposed in the literature.

The Journal of the Operational Research Society, Vol. 66, No. 4 (APRIL 2015), pp. 615-626 (12 pages) We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel ...

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

A couple of weeks ago, the APS's Physics ran a piece titled Traveling with a Quantum Salesman, about a quantum computing approach to the famous "Traveling Salesman" problem. I saw the headline, and ...

Tackling the traveling salesman problem with chemotaxis is a nice example of when the suboptimal is optimal, says Bartumeus. Of course, with all the information, time and resources in the world, ...

A classic mathematical problem that finds the shortest distance of round trip travel between multiple locations. The traveling salesman problem (TSP) generates directions from city 1 to city 2 and so ...