Sparse Integer Programming Is FPT

Explore a 35-minute lecture on sparse integer programming and its fixed-parameter tractability, presented by Shmuel Onn at the Hausdorff Center for Mathematics. Delve into the culmination of extensive research, examining linear and separable convex objectives in variable dimensions. Discover the far-reaching implications of this result as a powerful tool in parameterized complexity. Learn about related concepts such as tree depth, n-fold and tree-fold integer programming, and multistage stochastic integer programming. Gain insights into the progression of research in this field and its potential applications.