A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs |
scientific article; zbMATH DE number 6901641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs |
scientific article; zbMATH DE number 6901641 |
Statements
A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (English)
0 references
11 July 2018
0 references
stochastic knapsack problem
0 references
dynamic programming
0 references
shortest path problem with resource constraints
0 references
0 references
0 references
0 references
0 references
