Showing 2025Show all
2 papers · 1 filter
cs.DM2025
A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
Ismail Alkhouri, Mian Wu, Cunxi Yu +3
We propose a scalable framework for solving the Maximum Cut (MaxCut) problem in large graphs using projected gradient ascent on quadratic objectives. Our approach is differentiable…
cs.LG2025
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…