The Traveling Salesman Problem: Algorithms & Optimization (18w5088)

The Banff International Research Station will host the "The Traveling Salesman Problem: Algorithms & Optimization" workshop from September 23rd to September 28th, 2018.

The Traveling Salesman Problem (TSP) is a key topic in the area of discrete optimization. It has many applications and it occupies a central place in the theory of algorithms as well as in mathematical programming.

The problem has been studied intensely for over 60 years. Almost all of the emerging new ideas and techniques in the areas of algorithms and optimization have been applied to the TSP. In turn, these efforts have given rise to important new sub-disciplines such as survivable network design.

The workshop will focus on a small number of themes that are attracting high interest in the areas of algorithms and optimization. Each of these has taken shape over the past few years, and the potential for significant progress is ripe.

The Banff International Research Station for Mathematical Innovation and Discovery (BIRS) is a collaborative Canada-US-Mexico venture that provides an environment for creative interaction as well as the exchange of ideas, knowledge, and methods within the Mathematical Sciences, with related disciplines and with industry. The research station is located at The Banff Centre in Alberta and is supported by Canada's Natural Science and Engineering Research Council (NSERC), the U.S. National Science Foundation (NSF), Alberta's Advanced Education and Technology, and Mexico's Consejo Nacional de Ciencia y Tecnología (CONACYT).