Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-009-0577-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058409291 / rank | |||
Normal rank | |||
Revision as of 20:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm |
scientific article |
Statements
Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (English)
0 references
20 September 2010
0 references
static stochastic Knapsack problems with random weights
0 references
simple recourse
0 references
chance constrained
0 references
expectation constrained
0 references
stochastic gradient algorithm
0 references
arrow-hurwicz
0 references
SOCP
0 references
