Natashia Boland - University of Melbourne

Discrete Optimisation: From Applications to Theory and Back Again

Theoretical advances in integer programming have, over the past decade, transformed practitioners' ability to solve industrial discrete optimisation problems. Now more than ever before we can solve real problems, in all their complexity. However the extent to which applications have driven this theoretical development is not always well appreciated. In this talk I will discuss applications: how fundamental structures have been identified in applications, how common structures arise, and what theoretical advances these have inspired.