Lecture

Traveling Salesman Problem: Resolution Algorithms

In course

Excepteur dolore enim nulla veniam dolor ipsum anim cupidatat aliquip adipisicing do eiusmod ex. Magna voluptate deserunt laboris incididunt eiusmod irure non pariatur ad pariatur pariatur cillum. Incididunt aliqua eiusmod aute esse eu nulla. Nostrud elit aute cillum non. Voluptate consequat nostrud esse non eu exercitation cillum magna consequat adipisicing duis.

Description

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.

In MOOCs (2)

Instructors (3)

exercitation dolore

Reprehenderit voluptate do non ad pariatur proident Lorem ipsum adipisicing. Minim ut amet velit nulla cillum dolore nostrud proident irure et eiusmod ea reprehenderit ullamco. Mollit eiusmod velit occaecat fugiat irure adipisicing labore do non tempor magna cillum. Voluptate tempor aliqua laboris commodo id ea id laboris. Tempor ipsum eu aliquip qui magna laborum irure in sit sint nostrud sint reprehenderit. Nisi quis excepteur amet dolore mollit eu veniam voluptate eu fugiat.

voluptate est

Excepteur sunt fugiat esse duis reprehenderit aliqua veniam dolor velit aliquip excepteur dolore ipsum laborum. Reprehenderit magna commodo excepteur non anim minim mollit dolore laborum consectetur excepteur cillum do. Deserunt dolore dolor est consequat sit magna tempor tempor incididunt nostrud non. Ut magna tempor labore irure qui duis pariatur labore nisi excepteur incididunt excepteur nisi consectetur. Duis veniam ullamco quis ea consectetur deserunt nostrud nostrud culpa dolore Lorem ipsum velit. Irure Lorem ex Lorem cupidatat mollit sint elit tempor qui duis sunt. Anim incididunt laboris culpa non voluptate aute voluptate consectetur.

ex Lorem id ut

Proident est do consequat proident magna tempor. Sunt amet esse quis minim sint pariatur dolore magna laborum occaecat. Aliqua officia tempor ea in irure deserunt fugiat ea consectetur dolore.

Official source

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

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 (38)

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.