Maximizing expected utility over a knapsack constraint (Q1785738): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.12.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2234206629 / rank | |||
Normal rank | |||
Revision as of 19:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing expected utility over a knapsack constraint |
scientific article |
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
