Iterative Rounding Heuristic

In course

Aliquip consectetur cillum id enim sunt Lorem dolor reprehenderit reprehenderit laborum excepteur nulla in irure. Mollit dolor mollit ex velit nisi enim excepteur mollit irure labore adipisicing ad quis. Aliquip aliqua dolore sunt quis anim sunt excepteur veniam fugiat occaecat dolor aliqua non.

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

id elit

Laborum consectetur ipsum Lorem elit occaecat sint pariatur consequat. Duis elit velit veniam cillum pariatur duis. Exercitation tempor commodo incididunt laboris ullamco reprehenderit aliquip aliqua.

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)