Mixed-Integer Programming Techniques for the Connected Max-k-Cut Problem
Christopher Hojny
Eindhoven University of Technology, The Netherlands
Abstract:
We consider an extended version of the classical Max-k-Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review existing as well as develop new branch-and-cut techniques like cuts, branching rules, propagation, primal heuristics, and symmetry handling. We indicate how these techniques can be implemented using SCIP and analyze the impact of the different techniques based on the underlying graphs.