[DMO] Lara Scavuzzo Montaña : Lattice reformulations for Integer Programming
23 November 2023 14:00 till 15:00 - Location: Lecture Hall D@ta, 36.HB.01.630 | Add to my calendar
Integer Programs (IP) play a pivotal role in addressing complex optimization problems with discrete decision variables. IPs are typically solved with the branch-and-bound algorithm using single-variable disjunctions. In contrast, all algorithms for IP that offer theoretical guarantees use a non-binary search tree with general disjunctions based on lattice structure. These algorithms are not used in practice because such disjunctions are expensive to compute and challenging to implement. However, some lessons can be drawn. In this presentation, we will discuss algorithms for IP using that point of view. In particular, we will discuss lattice reformulations for IP, which can be re-interpreted as heuristic methods to obtain general disjunctions in the original space.