Maximizing expected utility over a knapsack constraint

DOI10.1016/j.orl.2015.12.016zbMath1408.91072OpenAlexW2234206629MaRDI QIDQ1785738

Jiajin Yu, Shabbir Ahmed

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.12.016

zbMATH Keywords

approximation algorithmsubmodularityknapsack problemutility maximizationsample average approximation

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Utility theory (91B16)

Related Items (3)

Maximizing a class of submodular utility functions with constraints ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ Sequence independent lifting for a set of submodular maximization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing a class of submodular utility functions
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• On a discrete nonlinear and nonseparable knapsack problem
• A note on maximizing a submodular set function subject to a knapsack constraint
• A threshold of ln n for approximating set cover
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Lectures on Stochastic Programming
• Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

This page was built for publication: Maximizing expected utility over a knapsack constraint