re: Knapsack problem algorithms for my real-life carry-on knapsack VIEW POST


As a note, I believe this problem is np hard in the general sense, so I don’t think trying all the combinations by brute force would normally scale very well. I’m not sure when it breaks down though.


This is a bit trickier than I originally thought. The problem is “weakly” np hard. See for more details.

code of conduct - report abuse