BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:The Traveling Salesman Problem: Amazon Deliveries\, Pub Walks\, an
 d Astro Tours [Public Event]
DTSTART:20251203T151500Z
DTEND:20251203T160000Z
DTSTAMP:20260815T095000Z
UID:indico-event-897@math-events.uni-bonn.de
DESCRIPTION:Speakers: Willam Cook (University of Waterloo / Research Fello
 w at the Research Institute for Discrete Mathematics of the University of 
 Bonn)\n\nZusammenfassung:Is it possible to compute the shortest route thro
 ugh a large number of stops? The task\, known as the traveling salesman pr
 oblem\, strikes fear in the heart of the computing world. The Washington P
 ost reports it would take "1\,000 years to compute the most efficient rout
 e between 22 cities." Claims such as this\, however\, ignore 70 years of i
 ntense study. A 22-city TSP can be handled easily with modern methods. Ind
 eed\, we discuss techniques used to find to precise optimality the shortes
 t walking tour to 81\,998 pubs in Korea and to find approximate solutions 
 to visit over 100\,000\,000 stars.
\nThe general setting is the followin
 g. Complexity theory suggests there are limits to the power of general-pur
 pose computational techniques. But what are these limits and how widely do
  they constrain our quest for knowledge? The TSP can play a crucial role i
 n this discussion\, demonstrating whether or not focused efforts on a sing
 le\, possibly unsolvable\, model will produce results beyond our expectati
 ons.\n\nhttps://math-events.uni-bonn.de/event/897/
LOCATION:XII - Hörsaal (Uni-Hauptgebäude)
URL:https://math-events.uni-bonn.de/event/897/
END:VEVENT
END:VCALENDAR