Hi All,
I am exploring algorithms that attempt to find best solutions to
TSP in Polynomial time (P).
Any solutions, hacks, c source code, names of ftp sites, ideas
most welcomed.
I'll try to maintain a list of good sources which will be made
available to all respondents.
cheers
andrew
*** There aren't any statues dedicated to critics *** +----------------------------------------------------------------------+
| 15/38 Onslow Rd | Voice 0011 619 381 8731 |
| Shenton Park, Australia 6008 | E-mail and...@cs.uwa.edu.au | +----------------------------------------------------------------------+
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 489 |
Nodes: | 16 (2 / 14) |
Uptime: | 51:19:03 |
Calls: | 9,671 |
Calls today: | 2 |
Files: | 13,719 |
Messages: | 6,170,459 |