Per-Round Knapsack-Constrained Linear Submodular Bandits.

Baosheng Yu Meng Fang Dacheng Tao

Published in: Neural Comput. (2016)

Keyphrases

dynamic programming
greedy algorithm
knapsack problem
objective function
upper bound
closed form
simple linear
database
data sets
data mining
machine learning
information systems
case study
high order
piecewise linear
packing problem