Title:  Recent progress in two-row cuts for Mixed-Integer Programming

Since a seminal paper by Andersen et al. (2007), there has been a lot of focus on cutting planes for Mixed-Integer Programming derived from multiple rows of a simplex tableau. Indeed, these types of cutting planes (or cuts) have some very nice geometric interpretations and generalize perhaps the most successful type of cutting plane in practice: Gomory cuts. In this talk we will survey some recent results on the subject and present some future research directions. No prior knowledge will be assumed.