Branch-and-cut For An Sdp Relaxation Of Large-scale Minimum Bisection Problems by Michael Armbruster