Presenter: Santanu Dey, CORE Belgium
Title: Extreme Inequalities for Multiple-Constraint Group Relaxations of Mixed Integer Programs
Abstract:
One of the most successful cutting planes used in Mixed Integer Programming (MIP) solvers, the Gomory Mixed Integer Cut (GMIC), is derived using single constraint relaxation of a MIP. It is, in fact, an extreme inequality for the single-constraint infinite-group relaxation of a MIP. Numerical and theoretical studies suggest that
