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

2018 ◽  
Vol 97 ◽  
pp. 111-124 ◽  
Author(s):  
Troels Martin Range ◽  
Dawid Kozlowski ◽  
Niels Chr. Petersen
Keyword(s):  
Shortest Path ◽  
Knapsack Problem ◽  
Stochastic Knapsack ◽  
Stochastic Knapsack Problem

scholarly journals A Stochastic Knapsack Problem with Continuous Random Capacity

2008 ◽  
Vol 4 (4) ◽  
pp. 269-276 ◽  
Author(s):  
Suwitchporn Witchakul ◽  
Prapaisri Sudas Na Ayudhaya ◽  
Peerayuth Charnsethi
Keyword(s):  
Knapsack Problem ◽  
Stochastic Knapsack ◽  
Random Capacity ◽  
Stochastic Knapsack Problem

Distributionally Robust Stochastic Knapsack Problem

2014 ◽  
Vol 24 (3) ◽  
pp. 1485-1506 ◽  
Author(s):  
Jianqiang Cheng ◽  
Erick Delage ◽  
Abdel Lisser
Keyword(s):  
Knapsack Problem ◽  
Stochastic Knapsack ◽  
Distributionally Robust ◽  
Stochastic Knapsack Problem
Sign in / Sign up

Export Citation Format

Share Document