Why does the salesman have to travel, when he can sell everything from home ?




On Tuesday, December 7, 1993 at 4:19:52 PM UTC+2, S.J. Bignell wrote:

I'm currently working on a project involving approximation algorithms to the Travelling Salesman Problem. Apparently Lin & Kernighan's heuristic algorithm published in Operations Research vol 21(I think) in 1973 is "the best yet".
I have a copy of the paper, but can't understand the algorithm.
Does anyone have source code in any language for this algorithm? Or can anyone
explain it?
Thanks
Spencer Bignell
sj...@cus.cam.ac.uk

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)