Integer Programs through the lense of Fixed-Parameter Tractability

Alexandra Lassota

Eindhoven University of Technology

Solving integer programs is mathematically hard. However, this does not imply that all instances are inherently hard to solve. A substantial body of research has focused on identifying such tractable subclasses of integer programs and developing efficient (fixed-parameter tractable) time algorithms for those. This talk will give a little overview of some of the key subclasses, results, and techniques.