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".--- Synchronet 3.20a-Linux NewsLink 1.114
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
Sysop: | DaiTengu |
---|---|
Location: | Appleton, WI |
Users: | 917 |
Nodes: | 10 (1 / 9) |
Uptime: | 09:16:05 |
Calls: | 12,176 |
Calls today: | 6 |
Files: | 186,522 |
Messages: | 2,235,031 |