Re: Traveling Salesman algorithm ?

--- In CAD_CAM_EDM_DRO@y..., rab@r... wrote:

> Don't suppose anyone can recommend a good algorithm for solving the
> Traveling Salesman problem ?
>
> Rab
>
> Rainnea Graphics

Rab,
The Traveling Salesman problem is famously non-polynomial complete,
meaning that it provably can not be solved (best answer) by a formal
algorithm. To find a "good enough" approximate answer you can use a
search method such as branch-and-bound and stop looking when the pain
level of the seach exceeds the pain of the best answer found so far.
Fred