There was an article some time ago about feasible but not necessarily
optimal solutions to the travelling salesman problem in, I think,
Scientific American. Can anybody point me at it please?
--
Tony Davie Department of Mathematical and Computational
Sciences
Tel: +44 334 63257 St.Andrews University
Fax: +44 334 63278 North Haugh
a...@dcs.st-andrews.ac.uk St.Andrews
Scotland
KY16 9SS
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (2 / 14) |
Uptime: | 01:20:11 |
Calls: | 10,387 |
Calls today: | 2 |
Files: | 14,061 |
Messages: | 6,416,728 |