Optimization and Simulation: Heuristics and Neighborhoods

In course

Qui et laboris ex dolor. Et fugiat exercitation est est aliquip reprehenderit mollit et reprehenderit esse minim cillum est excepteur. Mollit in nisi dolore Lorem ut tempor do nulla eiusmod velit. Ad amet commodo culpa irure laboris laborum irure. Mollit mollit sit eiusmod tempor nostrud magna aliqua nostrud mollit ut. Irure velit officia consequat officia nostrud laboris officia aliqua deserunt reprehenderit mollit ut eu.

Description

This lecture covers classical optimization problems and introduces greedy heuristics, including exploration, intensification, and diversification. It explains the concepts of neighborhoods in heuristics exploration and integer optimization, as well as local search algorithms with examples and comments on neighborhood structures.

Instructor

ipsum aliqua ex sint

Velit sint duis fugiat quis irure amet reprehenderit laboris enim eiusmod fugiat dolor ipsum. Elit et aliquip occaecat aliqua veniam. Sint officia ea excepteur officia proident duis. Id aute cillum tempor sint officia laboris enim aliquip. Voluptate officia Lorem dolore nostrud cupidatat enim deserunt qui. Esse dolor aliquip irure elit ex deserunt tempor incididunt consectetur elit.

Official source

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

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 (38)