基于最短路径的随机背包问题方法，具有非递减期望超载成本

A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs

Computers and Operations Research · 2018

被引 10