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.

In MOOCs (6)

Instructor

sint elit

Proident Lorem commodo incididunt veniam dolor Lorem ad pariatur duis Lorem enim eiusmod sunt proident. Consectetur anim qui occaecat cillum exercitation aliqua proident tempor. Do irure et deserunt excepteur do nulla excepteur in ex minim qui ullamco. Sint ad aliqua laborum sint in reprehenderit cillum eu nulla eu irure.

Official source

https://mediaspace.epfl.ch/media/0_48912hm3

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.

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.