Uploaded August 2021 | Updated September 2026, 45 minutes ago
Math Encounters: "Optimal Tours: The Traveling Salesman Problem" with Bill Cook on August 4, 2021
Is it possible to compute the shortest route through a large number of stops? It sounds simple, but finding a method that can do this quickly for every example would be a stunning breakthrough in mathematics — and would earn you a million-dollar prize. Join mathematician Bill Cook as we explore the history and applications of this fascinating challenge, and examine state-of-the-art approaches to solving it. Special introduction by Alex Kontorovich, MoMath’s 2020-2021 Distinguished Visiting Professor for the Public Dissemination of Mathematics and Rutgers math professor.
Math Encounters is a public presentation series celebrating the spectacular world of mathematics, presented by the Simons Foundation and the National Museum of Mathematics.
For further information, call the National Museum of Mathematics at 212-542-0566 or e-mail mathencounters@momath.org.
Math Encounters: "Optimal Tours: The Traveling Salesman Problem" with Bill Cook on August 4, 2021
Is it possible to compute the shortest route through a large number of stops? It sounds simple, but finding a method that can do this quickly for every example would be a stunning breakthrough in mathematics — and would earn you a million-dollar prize. Join mathematician Bill Cook as we explore the history and applications of this fascinating challenge, and examine state-of-the-art approaches to solving it. Special introduction by Alex Kontorovich, MoMath’s 2020-2021 Distinguished Visiting Professor for the Public Dissemination of Mathematics and Rutgers math professor.
Math Encounters is a public presentation series celebrating the spectacular world of mathematics, presented by the Simons Foundation and the National Museum of Mathematics.
For further information, call the National Museum of Mathematics at 212-542-0566 or e-mail mathencounters@momath.org.
