The online knapsack problem is a classic problem in the field of online
algorithms. Its canonical version asks how to pack items of different values
and weights arriving online into a capacity-limited knapsack so as to maximize
the total value of the admitted items. Although optimal co