Podcast: Latest 100 | LSE Public lectures and events | Audio and pdf
Episode: The Travelling Salesman Problem
Description: Is it possible to compute the shortest route through a large number of stops? The task, known as the traveling salesman problem, or TSP for short, sounds simple enough.
Click any word to see translations, usage examples & similar words. Then learn them using saved words.
Text not synced with the audio? See here for why certain podcasts won't sync.
