Margarita Castro (PUC)

Titulo: Cut generation procedures via decision diagrams

Abstract: Decision diagrams (DDs) are graphical structures that can encode complex combinatorial problems as network flow problems. This talk explains how to leverage this network flow reformulation to create valid inequalities for integer programming problems. We review the main components behind several cutting plane algorithms based on DDs and present recent advances in the field.

Related Sessions

View full schedule