Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258)

From MaRDI portal
Revision as of 13:42, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers