Seminar: Friedrich Eisenbrand (EPFL Lausanne), International speaker

Integer programming is a very versatile discrete optimisation problem with many applications in science and engineering. From the viewpoint of algorithms and complexity, it is an active area of research that offers interesting and visible open problems.  In this talk, I will survey some recent results on the complexity of integer programming. These include the general integer programming problem in standard form with small coefficients. Here field of parameterised complexity has developed tools to provide lower bounds on the complexity of IP based on the exponential time hypothesis (ETH). The goal of this talk is to give an overview on recent progress and open problems in this area.