Definition
0-1-Knapsack Problem
The 0-1-Knapsack problem is the family of selection problems built from a 0-1-Knapsack instance
and binary selection variables
. A selection is feasible exactly when The restriction
means that item is either omitted or selected once; items cannot be split or reused. The standard forms are the profit-maximisation problem and the decision problem.
What 0-1 means
The terms describe independent aspects of the problem:
Both the profit-maximisation problem and the decision problem impose the same