Given a graph whose arc traversal times vary over time, the time-dependent travelling salesman problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of ...

This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such ...

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

The task is the long-standing challenge known as the traveling salesman problem, or TSP for short. Finding a method that can quickly solve every example of the TSP would be a stunning breakthrough ...

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.

Techniques such as dynamic programming were able to get the number of routes to calculate down to n 2 2 n or 7,372,800 possible routes for 15 destinations, a far cry less than one trillion.