Sparse Integer Programming Is FPT
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
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.
Syllabus
Intro
Outline
Sparse Integer Programming
Tree Depth
Related Earlier and Latest Results
n-Fold and Tree-Fold Integer Programming
Multistage Stochastic Integer Programming
Taught by
Hausdorff Center for Mathematics
Related Courses
Linear and Discrete OptimizationÉcole Polytechnique Fédérale de Lausanne via Coursera Operations Research (1): Models and Applications
National Taiwan University via Coursera Operations Research (2): Optimization Algorithms
National Taiwan University via Coursera Dynamic Programming, Greedy Algorithms, and Intractability
University of Colorado Boulder via Coursera Operations Research
SUNY Binghamton University via YouTube