Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization.

arXiv:2605.19721v2 Announce Type: replace Abstract: Graph combinatorial optimization (GCO) has attracted growing interest, as many NP-hard problems naturally admit graph formulations, yet their combinatorial explosion renders exact methods computationally intr