I was wondering given a very small set of items, a medium and a very large what the best algorithms (Dynamic Programming, Greedy, Branch and Bound) are and their efficiencies.
I am pretty sure If I have four items(with different weights) and a capacity of 3000, Dynamic Programming might not be the best solution, given the complexity O(nW), but even Greedy doesn't give an optimal solution, so how does the size influence the algorithm to choose between these three?