Sign Up

1403 Circle Drive, Knoxville, TN 37996

View map

Speaker: Vyron Vellis

Title: The Traveling Salesman Problem

Abstract: One of the most famous problems in computer science is the Traveling Salesman Problem (TSP) which asks the following question: “Given a finite list of cities, what is the shortest possible route a traveling salesman has to take to visit each city?”. The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. In analysis, we asked ourselves a more general question: “Given again a list of cities (possibly infinite, even uncountable, or better, a continuum!), when can our traveling salesman travel them all in finite (optimal, in some sense) time?”. This question (known as the Analyst’s TSP) has been one of the core questions of geometric measure theory and its applications span almost all fields of modern analysis. In this talk, we will discuss this problem, its solution and related results.

Event Details

0 people are interested in this event

Calendar Powered by the Localist Community Event Platform © All rights reserved