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.

This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive ...

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

We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) ...

Is it hopeless to try to compute the shortest route to visit a large number of cities? Not just a good route but the guaranteed shortest. The task is the long-standing challenge known as the traveling ...

Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...