Jason Foster <[EMAIL PROTECTED]> asks:
> Unfortunately even with constant cost savings this is a > variant of the > Knapsack problem, which means it's NP-complete. Stefano's > cache would > then be a packing heuristic :) I think you're correct for a fully loaded system (which is when the algorithm matters). Of course that might be the reason for introducing randomness: Monte Carlo simulation can do a pretty effective job of getting an accurate approximation....
