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: | 741 |
| Nodes: | 16 (2 / 14) |
| Uptime: | 92:43:56 |
| Calls: | 12,456 |
| Calls today: | 6 |
| Files: | 15,197 |
| Messages: | 6,537,879 |