Lecture

Exact Methods for Integer Optimization

Description

This lecture introduces the concept of exact methods for integer optimization, focusing on Branch and Bound. It covers topics such as formulating integer optimization problems, finding upper and lower bounds, dividing the problem into subproblems, and representing the solution tree. Through examples and step-by-step explanations, the instructor illustrates how Branch and Bound can be applied to solve integer optimization problems effectively.

In MOOCs (6)

Instructor

nulla occaecat pariatur non

Laborum aute cillum dolor deserunt sint ad quis officia do. Id irure do adipisicing ipsum exercitation ad non eu laborum adipisicing adipisicing. Esse incididunt laboris do velit et ea aute. Consequat mollit commodo est cillum. Culpa ipsum dolore veniam excepteur ex ad in voluptate id. Do officia ullamco elit est ea.

Official source

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

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

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.