The NP-hard MAX-CUT problem considered to be the most difficult problem in computational theory is being targeted for use as a benchmark. This graph shows the results of evaluating the exact-solution ...