3.1.1 Max-Cut heuristic

With BiqCrunch we provide the Goemans-Williamson random hyperplane algorithm [3]. The heuristic is run after each node evaluation to get a feasible solution.