The traveling salesman problem is easy to state, and — in theory at least — it can be easily solved by checking every round-trip route to find the shortest one. The trouble with this brute ...

If the computation of each path were to take one microsecond in the travelling salesman problem, then trying to solve the problem using brute force becomes practically impossible beyond perhaps 12 ...

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

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

The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...

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

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.