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--- Synchronet 3.20a-Linux NewsLink 1.114
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
| Sysop: | DaiTengu |
|---|---|
| Location: | Appleton, WI |
| Users: | 1,089 |
| Nodes: | 10 (0 / 10) |
| Uptime: | 152:39:16 |
| Calls: | 13,921 |
| Calls today: | 2 |
| Files: | 187,021 |
| D/L today: |
3,596 files (906M bytes) |
| Messages: | 2,457,113 |