In the 0/1 version each item is used at most once; in the unbounded version any number of times.
Knapsack problem
Choose items with weights and values to maximise value within a weight capacity.
In the 0/1 version each item is used at most once; in the unbounded version any number of times.