Does anyone know if the classical "traveling salesmen" problem was ever solved or proven? (A traveling salesmen must visit each city exactly once - what is the shortest route to do so, and how do you prove it?)
Chris
| Sysop: | Keyop |
|---|---|
| Location: | Huddersfield, West Yorkshire, UK |
| Users: | 797 |
| Nodes: | 16 (3 / 13) |
| Uptime: | 173:36:10 |
| Calls: | 13,199 |
| Calls today: | 6 |
| Files: | 15,489 |
| Messages: | 6,579,334 |