Maximizing expected utility over a knapsack constraint (Q1785738): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.12.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2234206629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a discrete nonlinear and nonseparable knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2999661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems / rank
 
Normal rank

Latest revision as of 17:01, 16 July 2024

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
    knapsack problem
    0 references
    utility maximization
    0 references
    submodularity
    0 references
    sample average approximation
    0 references
    approximation algorithm
    0 references

    Identifiers