Activity: Talk or presentation types › Contributed talk › Scientific
Description
Integer Programs (IPs) are an ubiquitous and potent modeling tool, but in general also NP-hard to solve. Thus, special cases are studied that are solvable in polynomial time. One important case is that of block-structured IPs. The simplest class of such IPs have a constraint matrix consisting of independent sub-matrices that are linked by either few variables (2-stage stochastic IPs) or few constraints (n-fold IPs) This talk gives an overview on the results of these IPs (including our brand-new SODA results) and outlines the most important techniques to achieve them.
Period
2 Feb 2024
Held at
London School of Economics and Political Science, United Kingdom