The knapsack problem is one of the classical problems in combinatorial
optimization: Given a set of items, each specified by its size and profit, the
goal is to find a maximum profit packing into a knapsack of bounded capacity.
In the online setting, items are revealed one by one and t