Lecture

Optimization and Simulation

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

tempor sit aute

Dolor ad nostrud adipisicing deserunt excepteur ullamco irure labore dolor cillum non. Est mollit proident aliquip elit commodo. Laboris id Lorem aliquip enim laboris. Voluptate irure ad et ut.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.