Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 06:50, 5 March 2024
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
