## Researchers were able to overcome a barrier in improving the solution of traveling salesman problem

Nathan Klein and his University of Washington advisors Anna Karlin and Shayan Garan found a better way to solve the traveling salesman problem for the first time in nearly half a century. This is one of the most famous combinatorial optimization problems, which consists of finding the most profitable route through the specified cities and then returning to the original city. Over the decades, the challenge has inspired many of the fundamental advances in computer science and