This lecture covers Dognion's Theorem, which deals with infeasible Integer Programming (IP) problems. The instructor explains the proof of the theorem step by step, assuming different scenarios and providing mathematical justifications.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer s
