Discrete Optimization: Traveling Salesman Problem

This lecture introduces the traveling salesman problem, where the goal is to find the shortest itinerary visiting all cities exactly once. The instructor covers modeling the problem with decision variables and constraints, including additional constraints and a network representation. The lecture concludes with the formulation of the problem and a summary.