Optimization and Simulation

In course

Excepteur ipsum veniam eiusmod enim laborum ipsum. Aute ex magna in quis adipisicing adipisicing adipisicing sunt. Sint qui in fugiat occaecat nisi laboris cupidatat eiusmod cillum duis enim cillum quis et. Velit qui labore pariatur occaecat dolore dolore nostrud mollit. Enim commodo in amet sint velit adipisicing mollit pariatur. Aliqua ex commodo tempor aute. Nulla laboris aliquip sunt quis mollit eiusmod aliquip Lorem ut adipisicing minim proident commodo.

Description

This lecture covers the principles of greedy heuristics in optimization problems, including step-by-step construction of feasible solutions, knapsack and traveling salesman problems, and integrality constraints. It also discusses issues with rounding and compares optimization methods like exact methods, approximation algorithms, and heuristics.

Instructor

minim adipisicing minim officia

Deserunt laboris amet mollit velit est officia. Occaecat deserunt ut quis occaecat cillum. Elit sint et adipisicing occaecat eiusmod aute quis in deserunt adipisicing nisi dolore.

Official source

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

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

Related lectures (33)