Educational Technologies Center | McGraw Center for Teaching and Learning

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 Bill Cook, Combinatorics, Computational complexity theory, Cook, NP-hard, Society for Industrial and Applied Mathematics, Tech News, Travelling salesman problem, TSP
Comments Off on Lunch & Learn: In pursuit of the salesman: Mathematics at the limits of computation with Bill Cook