Tolerance.ca
Director / Editor: Victor Teboul, Ph.D.
Looking inside ourselves and out at the world
Independent and neutral with regard to all political and religious orientations, Tolerance.ca® aims to promote awareness of the major democratic principles on which tolerance is based.

Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that's stood for nearly half a century

By Nathan Klein, PhD Student in Computer Science, University of Washington
Share this article
The traveling salesperson problem is so difficult that practical solutions can never be perfect – only good enough. The challenge is coming up with the best approximations.


Read complete article

© The Conversation -


Follow us on ...
Facebook Twitter