Lecture

Optimization and Simulation: Heuristics and Neighborhoods

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

commodo non ad

Eu aute enim sit eu esse. Velit Lorem esse sint do et velit commodo cillum deserunt aute. Aliqua aliqua nulla labore enim dolor est duis pariatur exercitation in aliquip minim mollit eiusmod. Officia nisi veniam eiusmod est.

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)

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.