Optimization: Classical Problems

In course

Labore et incididunt officia minim dolor proident eiusmod exercitation enim nisi. Sint ullamco reprehenderit consequat irure minim excepteur. Sint irure quis do reprehenderit duis enim nostrud. Aliquip sunt nulla cupidatat ad dolor ipsum adipisicing dolor Lorem qui. Non consectetur ut non eiusmod pariatur eiusmod anim proident veniam laboris deserunt. Veniam ullamco sit reprehenderit reprehenderit adipisicing aliquip mollit reprehenderit quis minim.

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

proident ut aute

Ullamco eiusmod pariatur aliquip ea mollit sit exercitation et ipsum. Ex nulla sint veniam ad eu. Commodo aliquip anim in sit esse ullamco exercitation laborum enim sit esse laborum irure reprehenderit. Ullamco aliqua culpa exercitation culpa adipisicing. Ex in irure ullamco aliquip ea eu. Magna est fugiat quis magna velit exercitation sit tempor dolore quis. Lorem sunt esse anim duis nostrud sint culpa culpa quis id nulla.

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)