Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint (Q2300078)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint |
scientific article |
Statements
Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint (English)
0 references
24 February 2020
0 references
non-submodular
0 references
knapsack constraint
0 references
submodularity ratio
0 references
curvature
0 references
diminishing-return ratio
0 references
