With neither minds nor maps- chemical-sensing immune players do well with decades-old mathematical problem, a computer simulation reveals.

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

And even the most unrelenting brute-force attack on the traveling salesman problem (TSP) might not be enough. Finding the shortest way around a 33-city route would require calculating the distances ...

We consider a variant of the classical symmetric Traveling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This ...

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.