74%Highly rated
?Highly ratedVote to see the score
Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
A feasibility-preserving graph neural network replaces SDP solvers in exact Max-Cut branch-and-bound, cutting bounding costs up to 10.6× versus Mosek.
Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 PM, Hall C1 · Published 2026
– ReadersNo votes yet
9/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 9 of 20 reviewers recommend it
lenient 3/5
medium 5/10
strict 1/5