Traveling Salesman Problem: Resolution Algorithms

This lecture covers the Traveling Salesman Problem, where a closed path passing once through a set of cities must be found. The instructor explains the 'Euclidean' version and presents resolution algorithms, including testing all possible paths and heuristic approaches. The lecture also discusses the minimum spanning tree concept and the use of shortcuts to optimize the path. An interesting example involving a unicellular organism capable of problem-solving is presented.