A relaxed FPTAS for chance-constrained knapsack (Q5091069)
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: A relaxed FPTAS for chance-constrained knapsack |
scientific article; zbMATH DE number 7561426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed FPTAS for chance-constrained knapsack |
scientific article; zbMATH DE number 7561426 |
Statements
21 July 2022
0 references
stochastic knapsack
0 references
chance constraint
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
0 references
0.8722362518310547
0 references
0.818504810333252
0 references
0.8046780824661255
0 references
0.8008697628974915
0 references
0.7959772348403931
0 references
