This routing problem is equivalent to the travelling salesman problem and therefore not amenable to a perfect solution in a reasonable time .
The travelling salesman problem is NP complete .
This routing problem is equivalent to the travelling salesman problem , which is NP complete , and therefore not amenable to a perfect solution in a reasonable time .