N(CO)^2 applies reinforcement learning with chance constraints to solve stochastic orienteering problems, generalizing across instances with performance competitive to MILP.
Zuzu ´arregui and S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
N(CO)$^2$: Neural Combinatorial Optimization with Chance Constraints to Solve Stochastic Orienteering
N(CO)^2 applies reinforcement learning with chance constraints to solve stochastic orienteering problems, generalizing across instances with performance competitive to MILP.