Maximizing expected utility over a knapsack constraint
type: Item
instance of: scholarly article
title: Maximizing expected utility over a knapsack constraint
zbMATH Open document ID: 1408.91072
author: Jiajin Yu
author: S. Ahmed
published in: Operations Research Letters
publication date: 2018-10-01T00:00:00Z
Mathematics Subject Classification ID: 91B16
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6945851
zbMATH Keywords: knapsack problem
zbMATH Keywords: utility maximization
zbMATH Keywords: submodularity
zbMATH Keywords: sample average approximation
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.orl.2015.12.016
OpenAlex ID: W2234206629
cites work: Maximizing a class of submodular utility functions
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
cites work: A threshold of ln n for approximating set cover
cites work: On a discrete nonlinear and nonseparable knapsack problem
cites work: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
cites work: Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
cites work: Q4830009
cites work: Lectures on Stochastic Programming
cites work: A note on maximizing a submodular set function subject to a knapsack constraint
cites work: Q2999661
cites work: Q5844986
cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
DOI: 10.1016/J.ORL.2015.12.016
description: scientific article; zbMATH DE number 6945851