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: | 715 |
| Nodes: | 16 (2 / 14) |
| Uptime: | 150:17:14 |
| Calls: | 12,091 |
| Calls today: | 4 |
| Files: | 15,000 |
| Messages: | 6,517,595 |