Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291)
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: Maximizing a monotone non-submodular function under a knapsack constraint |
scientific article; zbMATH DE number 7558381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing a monotone non-submodular function under a knapsack constraint |
scientific article; zbMATH DE number 7558381 |
Statements
Maximizing a monotone non-submodular function under a knapsack constraint (English)
0 references
18 July 2022
0 references
non-submodular
0 references
knapsack constraint
0 references
submodularity ratio
0 references
curvature
0 references
diminishing-return ratio
0 references
0 references
0.8763880729675293
0 references
0.8647215366363525
0 references
0.859595000743866
0 references
0.8589165806770325
0 references
