Reformulating DP as GPU kernels delivers 100- to 100,000-fold speedups for stochastic vehicle routing and inventory problems, enabling much larger scenario sets and stronger first-stage decisions.
The extensive model is: min x, z, u, l 1 |Ω| X ω∈Ω X k∈K X (i,j)∈A (δij +S j)x ω ijk +β X k∈K lω k (5) s.t
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
From Sequential to Parallel: Reformulating Dynamic Programming as GPU Kernels for Large-Scale Stochastic Combinatorial Optimization
Reformulating DP as GPU kernels delivers 100- to 100,000-fold speedups for stochastic vehicle routing and inventory problems, enabling much larger scenario sets and stronger first-stage decisions.