Submodular Maximization with Uncertain Knapsack Capacity.

Yasushi Kawase Hanna Sumita Takuro Fukunaga

Published in: LATIN (2018)

Keyphrases

objective function
knapsack problem
greedy algorithm
feasible solution
optimal solution
decision making
dynamic programming
packing problem
budget constraints
upper bound
high order
real time
case study
artificial intelligence
multiple choice
high capacity
real world