Maximizing expected utility over a knapsack constraint (Q1785738)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6945851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing expected utility over a knapsack constraint |
scientific article; zbMATH DE number 6945851 |
Statements
Maximizing expected utility over a knapsack constraint (English)
0 references
1 October 2018
0 references
knapsack problem
0 references
utility maximization
0 references
submodularity
0 references
sample average approximation
0 references
approximation algorithm
0 references
0 references
0.8238728642463684
0 references
0.8227970600128174
0 references
0.8103420734405518
0 references
0.8006777167320251
0 references
0.7966631054878235
0 references
