Cutting planes are an essential component of any practical mixed-integer optimization software package. Although they have been around for several decades, and have an extensive literature on the theoretical side, much less is known about the practical behaviour of them, especially when multiple cuts are considered together. In this talk we will highlight a few challenges and illustrate them with examples from the MIPLIB2017 benchmark library.

Imre Polik is a Senior Manager in charge of the linear and integer optimization offerings of the SAS/OR software package. He received his PhD in Mathematics from McMaster University in 2007. After spending a couple of years at Lehigh University as an Assistant Professor, he joined SAS Institute in 2010.

His research interests include all aspects of computational optimization, conic optimization and duality theory.