Algorithm Engineering and Integer Programming for the Maximum Cut Problem

The maximum cut problem, MaxCut for short, is one of the fundamental problems in combinatorial optimization. It is part of a large family of graph partitioning problems that ask for a division of all vertices of the graph into disjoint sets. In its optimization form MaxCut is about finding a biparti... View More