Abstract: The graph maxcut (MaxCut) problem is NP-hard. There are many local optima, and it is computationally difficult to find a high-quality solution. In this paper, we propose a fast machine ...