An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns (Q4031999)
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: An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns |
scientific article; zbMATH DE number 151901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns |
scientific article; zbMATH DE number 151901 |
Statements
An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns (English)
0 references
4 May 1993
0 references
stochastic linear knapsack problem
0 references
0.8194611072540283
0 references
0.8182139992713928
0 references
0.8157160878181458
0 references
