 of the knapsack problem can be represented by a binary vector (x 0,..., x n ), in which x i = 0 if item i is selected, x i = 0 otherwise, for every i = 0,..., n. A solution S = (x 0,..., x n ) belongs to the feasible set F if ∑ i 