Reward-Weighted Preference Optimization for Selective Combinatorial Optimization Problems.
arXiv:2610.31239v1 Announce Type: new Abstract: Reinforcement learning has emerged as an effective approach for combinatorial optimization, but most existing methods focus on problems such as the Travelling Salesperson Problem (TSP) in which all elements must
arXiv cs.AIResearch source·