Computational experience with a SDP-based algorithm for maximum cut with limited unbalance

We address the following problem: given an undirected graph G = (V,E), with vertex set V of cardinality n and edge set E, where each edge (i, j) has a non-negative integer weight wij , and given a constant B, 0 ≤ B < n, find a cut (S, V \ S) of G of maximum weight such that the difference between the cardinalities of the two shores of the cut is not greater than B. This problem has been introduced in [4] with the name Maximum Cut with Limited Unbalance (MaxCUT-LU for short). When B is equal to zero it is known as the Max Bisection problem, whereas when B is equal to n− 1 it is the well-known Maximum Cut problem.