Branch-and-Cut for an SDP Relaxation of Large-Scale Minimum Bisection Problems | DealShopping Deutschland