Algorithm For Professional Programmer
Tuesday, June 20, 2017
What is 0-1 Knapsack Problem?
0-1 Knapsack Problem :
Given two n-tuples of positive numbers (<V
1
,V
2
,.....,V
n
) and (<w
1
,w
2
,w
3
,.....,w
n
and W>0, We wish to determine the subset T∈{1,2,3,....,n} (of files to store)) that maximizes ∑
ieT
V
i
subject to ∑
ieT
w
i
≤W
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
