Packing a Knapsack of Unknown Capacity.

Yann Disser Max Klimm Nicole Megow Sebastian Stiller

Published in: SIAM J. Discret. Math. (2017)

Keyphrases

packing problem
knapsack problem
dynamic programming
maximum profit
upper bound
machine learning
optimal solution
np hard
feasible solution
integer programming
capacity planning
high capacity
limited capacity