Beyond Inference-Time Search: Reinforcement Learning Synthesizes Reusable Solvers
DGX agentarXiv:2605.18374v1 Announce Type: cross Abstract: Large language models (LLMs) typically approach combinatorial optimization as an inference-time procedure, solving each instance separately through sa