Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.
Official source
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.