Lecture

Discrete Optimization: Traveling Salesman Problem

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.