Maximizing expected utility over a knapsack constraint (Q1785738)

From MaRDI portal
Revision as of 14:19, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximizing expected utility over a knapsack constraint
scientific article

    Statements

    Maximizing expected utility over a knapsack constraint (English)
    0 references
    0 references
    0 references
    1 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problem
    0 references
    utility maximization
    0 references
    submodularity
    0 references
    sample average approximation
    0 references
    approximation algorithm
    0 references