Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization
DGX agentarXiv:2605.19721v1 Announce Type: new Abstract: Graph combinatorial optimization (GCO) has attracted growing interest, as many NP-hard problems naturally admit graph formulations, yet their combinator