Suppose the usual dynamic programming algorithm for the knapsack problem. If we swap the max    with an addition, does the modified algorithm compute all the solutions with benefit $\leq W$? I described the problem very briefly but I think anyone familiar with these notion wouldn't find any difficulty understanding what I ask. I think the complexity stays $nW$. Is it right?
Dynamic programming for counting knapsack solutions
algorithms;dynamic programming;knapsack problems;counting