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.21d-Linux NewsLink 1.2
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: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 63 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 492924:26:36 |
| Calls: | 840 |
| Calls today: | 1 |
| Files: | 1,300 |
| D/L today: |
4 files (14,876K bytes) |
| Messages: | 258,196 |