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 the normal view instead:
scientific article; zbMATH DE number 6467095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization |
scientific article; zbMATH DE number 6467095 |
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
0.7651614546775818
0 references
0.758560061454773
0 references
0.7347555756568909
0 references
0.7283796072006226
0 references
0.7274673581123352
0 references
