in Algorithms retagged by
274 views
0 votes
0 votes

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

Not How to

in Algorithms retagged by
by
274 views

1 comment

0
0

1 Answer

0 votes
0 votes
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 :)