The Traveling Salesman Problem: A Computational Study offers a comprehensive look at one of the most interesting applications of computational mathematics. The problem itself is deceptively simple; given a set of cities and the cost of travel between each pair, it tests your ability to find the cheapest route that visits everyone on the list before returning home.
This simple challenge has had far-reaching applications throughout mathematics, prompting research by mathematicians, chemists, and physicists alike. From applications in genetics and telecommunications to usage in classrooms, this subject has proven its importance time and time again. The Traveling Salesman Problem: A Computational Study provides an essential look into one of its core topics for those interested in gaining more knowledge on an ever-expanding math field.