Tag Archives: NP-hard

Lunch & Learn: In pursuit of the salesman: Mathematics at the limits of computation with Bill Cook

The traveling salesman problem, or TSP for short, is easy to state: given a number of cities along with the cost of travel between each pair of them, find the cheapest way to visit them all and return to your … Continue reading

Posted in Lunch & Learn, Training and Outreach | Tagged , , , , , , , , | Comments Off