Q.

What is the solution to the knapsack problem?

A. many-to-many mapping
B. one-to-many mapping
C. many-to-one mapping
D. one-to-one mapping
Answer» D. one-to-one mapping
Explanation: the knapsack problem is associated with the size constraints, that is the size of the scratch pad memories. this problem can be solved by one-to-one mapping which was presented in an integer programming model by steinke et al.
1.4k
0
Do you find this helpful?
4

Discussion

No comments yet