From Newsgroup: comp.programming
Why does the salesman have to travel, when he can sell everything from home ? On Monday, December 6, 1993 at 12:44:38 PM UTC+2, S.J. Bignell wrote:
I am currently working on a project involving approximation algorithms to the Travelling Salesman problem. Lin & Kernighan published a paper in 1972 in Operations Research containing "the best algorithm yet" - I have a copy of the
paper but I can't get my head around the algorithm given.
Does anyone have some source code for the algorithm, or can anyone supply me with a further explanation?
Thanks
Spencer Bignell
sj...@cus.cam.ac.uk
--- Synchronet 3.20a-Linux NewsLink 1.114