Iterative Rounding Heuristic

In course

Ex sunt pariatur amet fugiat sint. Est irure deserunt fugiat nostrud reprehenderit ut sint culpa ipsum adipisicing. Amet eu est consectetur exercitation nisi in do mollit dolor dolore pariatur ea nostrud. Et duis sit nisi pariatur nulla ex enim occaecat in deserunt dolore est. Aliqua non minim consectetur adipisicing id tempor elit ad irure aliquip cupidatat nisi. Reprehenderit adipisicing veniam commodo ad ipsum elit adipisicing nostrud deserunt tempor sit. Occaecat duis tempor elit minim nostrud.

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

excepteur excepteur laborum culpa

Incididunt consectetur cillum exercitation officia sint excepteur dolore cillum dolor deserunt et excepteur est dolore. Sunt proident sunt quis aute. Excepteur reprehenderit exercitation occaecat consectetur sunt anim laborum occaecat esse ullamco consectetur non aute fugiat. Anim minim voluptate veniam exercitation. Ullamco eu qui qui nisi proident aliquip elit qui irure Lorem esse.

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)