A Dataless Reinforcement Learning Approach to Rounding Hyperplane Optimization for Max-Cut

Gabriel Maliakal, Ismail Alkhouri, Alvaro Velasquez +2

The Maximum Cut (MaxCut) problem is NP-Complete, and obtaining its optimal solution is NP-hard in the worst case. As a result, heuristic-based algorithms are commonly used, though…