Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities.

Sungjin Im Benjamin Moseley

Published in: ICALP (1) (2015)

Keyphrases

knapsack problem
dynamic programming
database
real time
decision trees
reinforcement learning
upper bound
improved algorithm
weighted sum
packing problem
linear inequalities