2:30pm–3:10pm Wednesday, 07/18/2012
The Traveling Salesman Problem is a classic example of an NP-Complete task that is much more difficult than it seems on the surface. There are a number of algorithms available for solving it. In this session, we will look at different options for implementing complex mathematics within Python. We will evaluate the different options in relation to the specific algorithms used.