Question

Any integer programming problem involving 0-1 variables with only one constraint is called a knapsack problem.

Answer

This answer is hidden. It contains 1 characters.