Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 12:02, 28 February 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
