Serge Ballif added One_of_the_most_famous__.md  over 8 years ago

Commit id: 4f7490564de63133c609a4ce031316fa6a9b58b5

deletions | additions      

         

One of the most famous applications of graphs is in studying the Traveling Salesman problem. In this problem a salesman must determine the optimal path in which to visit all the cities in his area. When the number of cities is small the problem is fairly easy. However, when the problem gets large (more than 10,000 vertices) there is no way to consider all the possibilities. Mathematicians and computer scientists have developed various algorithms for approximating the shortest/cheapest path. Delivery companies such as FedEx need to solve such problems thousands of times per day.