Dynamic Programming

Question

What is the best way to solve a 0/1 knapsack problem? Any trick to solve it without wasting much time?

Not How to

Comments

refer : http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf

Answer 1

There is not a perfect way to solve o/1 KS optimization problem, it is quite intuitive.

You can use Table Method as usual or Tree method(Branch and bound) !!!

Well, you can improve the speed by solving such problems :)