Ask
Login
0
15kviews
Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6
written 2.1 years ago by gravatar for yashshirsath2127 yashshirsath2127 • 20 modified 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k

Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6
analysis of algorithms
ADD COMMENT EDIT
1 Answer
2
1.8kviews
written 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k •   modified 2.1 years ago

Knapsack Problem

  • knapsack is like a container or a bag with limited weight capacity and a few items each having some weight and value.

  • If we have given some items which have some weights or profits then we have to put some items in the knapsack in such a way …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.