[ ] MCKP: Solving multiple-choice knapsack problem is expensive. It uses dynamic programming : it stores best intermediate results in a matrix. Since input do not change often, we can cache the matrix and use it multiple times with changing objective.
[ ] GKE: Gaussian kernel estimation is not changing a often as well.
[ ] MCKP: Solving multiple-choice knapsack problem is expensive. It uses dynamic programming : it stores best intermediate results in a matrix. Since input do not change often, we can cache the matrix and use it multiple times with changing objective.
[ ] GKE: Gaussian kernel estimation is not changing a often as well.