Iterative Rounding Heuristic

In course

DEMO: exercitation nulla pariatur exercitation

Eiusmod in nisi est minim incididunt velit cupidatat cupidatat occaecat proident. Amet magna fugiat eu pariatur velit tempor. Consectetur nisi excepteur ea fugiat ex nostrud aliquip minim ipsum nostrud elit ex in nulla. Commodo occaecat sunt aute ex exercitation do. Ipsum enim dolor ea ullamco commodo ut. Ullamco occaecat minim est nostrud reprehenderit velit do officia aliquip. Culpa eiusmod et consectetur ullamco laboris.

Description

This lecture covers topics such as optimal integer programming and linear programming relaxation, Gomory cuts, disjunction cuts, independent set in graphs, and an iterative rounding heuristic for searching the space of solutions in a maximization MILP. The instructor presents a detailed analysis of branch and bound steps, providing insights into the process of finding the best solution. Practical examples and a Branch and Bound tree traversal are used to illustrate the concepts discussed.

Instructor

Consectetur nisi nostrud velit eiusmod enim duis deserunt eiusmod pariatur. Laborum ipsum dolor labore qui proident sint culpa veniam esse. Dolore ex id enim reprehenderit ad culpa consequat dolore mollit.

Official source

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

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

Mathematics

Discrete mathematics: Graph theory

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (38)