Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641)
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: Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity |
scientific article |
Statements
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (English)
0 references
27 February 2020
0 references
chance-constrained knapsack problem
0 references
heuristic
0 references
robust optimization
0 references
submodularity
0 references
0 references
0.88957679271698
0 references
0.8780122399330139
0 references
0.8424281477928162
0 references
0.7802155017852783
0 references
0.7794615626335144
0 references
