06.05.2025 16:00 Alexandra Lassota:
Integer Programs meet Fixed-Parameter TractabilityMI 02.06.011 (Boltzmannstr. 3, 85748 Garching)
Solving Integer Programs (IPs) is generally NP-hard. But this does not imply that all instances are inherently hard. In fact, a substantial body of research has focused on identifying tractable subclasses and developing efficient (fixed-parameter tractable) time algorithms for those. This talk will give a little overview of some of the key results and techniques.