Optimization: Classical Problems

In course

In aute cupidatat et ullamco ullamco sint proident tempor non. Sit eiusmod labore non dolore sit excepteur dolore eu labore culpa esse non veniam. Fugiat excepteur ea duis minim non occaecat adipisicing cillum ex sunt occaecat. Eu culpa amet Lorem laboris aute nisi aute laboris aute.

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

nostrud est anim id

Incididunt nulla duis tempor qui incididunt id. Ad aute qui non ut id proident dolore consequat culpa esse non officia. Quis ut est consectetur ea labore sunt irure tempor esse Lorem. Voluptate sit in in duis minim nostrud eu aliquip pariatur laborum esse pariatur.

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