Lecture

Optimization: Classical Problems

Description

This lecture covers classical optimization problems, including the knapsack problem and the traveling salesman problem. It explains brute force algorithms, computational time complexities, and integer linear optimization. The instructor discusses feasible solutions, polyhedrons, and integer lattices.

Instructor

quis eu

Exercitation pariatur consectetur magna amet nisi nulla ipsum nulla duis velit excepteur id excepteur. Sit reprehenderit sit reprehenderit aliqua eiusmod. Reprehenderit eiusmod culpa id consequat exercitation ut aliquip ullamco voluptate consequat minim et. Sint aliquip aute est quis irure fugiat sit veniam dolore. Culpa eu aliquip laborum ea.

Official source

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

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Theory of computation: Computational complexity theory

Related lectures (42)

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.