Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258)
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: Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization |
scientific article |
Statements
Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (English)
0 references
29 July 2015
0 references
Sigmoid utility/\(S\)-curve
0 references
knapsack problem
0 references
generalized assignment problem
0 references
bin-packing problem
0 references
multi-choice knapsack problem
0 references
human attention allocation
0 references
0 references
