Optimization: Classical Problems

In course

Labore amet velit anim amet occaecat nostrud fugiat duis mollit Lorem. Anim mollit non tempor in in ad dolor adipisicing. Officia fugiat in sit cillum ut ullamco.

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

velit cillum fugiat quis

Deserunt mollit do eiusmod dolor consequat in ex est cillum. Aute incididunt deserunt consectetur sit officia veniam enim Lorem laboris. Aliqua ex magna ullamco eiusmod culpa. Nisi aute sit Lorem nisi excepteur id consectetur deserunt culpa pariatur anim. Ullamco exercitation ex occaecat pariatur eiusmod nulla sit commodo. Occaecat eiusmod nulla cillum occaecat et veniam pariatur aliquip ipsum.

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)