M/911

In this talk we present a review and some extensions on how indicator constraints in Mixed Integer Programming (MIP) are handled. In particular, we explore the disjunctive programming paradigm in this context, opposed to the classical big-M method. In the case of Mixed Integer Linear Programming, a clear relation between the two can be derived. We present some computational results that suggest the use of local information in MIP with Indicator constraints and sketch some ideas in this direction.

Oberseminar Diskrete Optimierung

Sven Wiese

DEI, University of Bologna, Italy