Dynamic Programming

0-1 Knapsack problem

Knapsack problem
Given some items, pack the knapsack to get
the maximum total value. Each item has some
weight and some value. Total weight that we can
carry is no more than some fixed number W.
So we must consider weights of items as well as
their values.
Item #
1
2
3

Weight Value
1
8
3
6
5
5
2

Knapsack problem
There are two versions of the problem:
1. 0-1 knapsack problem

Items are indivisible; you either take an item or not. Some

special instances can be solved with dynamic programming

2. Fractional knapsack problem

Items are divisible: you can take any fraction of an item

0-1 Knapsack problem

Given a knapsack with maximum capacity W, and

a set S consisting of n items

Each item i has some weight wi and benefit value

bi (all wi and W are integer values)

Problem: How to pack the knapsack to achieve

maximum total value of packed items?

0-1 Knapsack problem

Problem, in other words, is to find

max bi subject to wi W
iT

iT

The problem is called a 0-1 problem,

because each item must be entirely
accepted or rejected.

0-1 Knapsack problem:

brute-force approach
Lets first solve this problem with a
straightforward algorithm

Since there are n items, there are 2n possible

combinations of items.
We go through all combinations and find the one
with maximum value and with total weight less or
equal to W
Running time will be O(2n)

0-1 Knapsack problem:

dynamic programming approach

We can do better with an algorithm based on

dynamic programming

We need to carefully identify the subproblems

Defining a Subproblem

Given a knapsack with maximum capacity W, and

a set S consisting of n items

Each item i has some weight wi and benefit value

bi (all wi and W are integer values)

Problem: How to pack the knapsack to achieve

maximum total value of packed items?

Defining a Subproblem
w1 =2 w2 =4
b1 =3 b2 =5

w3 =5
b3 =8

Weight Benefit

w4 =3
b4 =4

?
Max weight: W = 20
For S4:
Total weight: 14
Maximum benefit: 20

w1 =2 w2 =4
b1 =3 b2 =5

w3 =5
b3 =8

w5 =9
b5 =10

For S5:
Total weight: 20
Maximum benefit: 26

wi

bi

10

Item

#
S4
S5

Solution for S4 is
not part of the
solution for S !!!

Recursive Formula for

subproblems (continued)
Recursive formula for subproblems:
V [i 1, w]

V [i, w]

if wi w

max{V [i 1, w], V [i 1, w wi ] bi } else

It means, that the best subset of Si that has total

weight w is:
1) the best subset of Si-1 that has total weight w,

or

2) the best subset of Si-1 that has total weight w-wi plus the
item i

10

Recursive Formula
V [i 1, w]
if wi w
V [i, w]
max{V [i 1, w],V [i 1, w wi ] bi} else

The best subset of Si that has the total weight w,

either contains item ith or not.
First case: wi>w. Item i cant be part of the solution,
since if it was, the total weight would be > w, which
is unacceptable.
Second case: wi w. Then the item i can be in the
solution, and we choose the case with greater value.

11

0-1 Knapsack Algorithm

for w = 0 to W
V[0,w] = 0
for i = 1 to n
V[i,0] = 0
for i = 1 to n
for w = 0 to W
if wi <= w // item i can be part of the solution
if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
12

Running time
for w = 0 to W
O(W)
V[0,w] = 0
for i = 1 to n
V[i,0] = 0
Repeat n
for i = 1 to n
for w = 0 to W
O(W)
< the rest of the code >

times

What is the running time of this

algorithm?
O(n*W)
Remember that the brute-force algorithm
takes O(2n)

13

Example
Lets run our algorithm on the
following data:
n = 4 (# of elements)
W = 5 (max weight)
Elements (weight, benefit):
(2,3), (3,4), (4,5), (5,6)
14

Example (2)
i\W 0
0
0
1
2
3
4

1
0

2
0

3
0

4
0

5
0

for w = 0 to W
V[0,w] = 0

15

Example (3)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0

2
0

3
0

4
0

5
0

for i = 1 to n
V[i,0] = 0

16

Example (4)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0

2
0

3
0

4
0

5
0

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
bi=3
wi=2
w=1
w-wi =-1

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
17

Example (5)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0

2
0
3

3
0

4
0

5
0

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
bi=3
wi=2
w=2
w-wi =0

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
18

Example (6)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0

2
0
3

3
0
3

4
0

5
0

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
bi=3
wi=2
w=3
w-wi =1

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
19

Example (7)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0

2
0
3

3
0
3

4
0
3

5
0

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
bi=3
wi=2
w=4
w-wi =2

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
20

Example (8)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0

2
0
3

3
0
3

4
0
3

5
0
3

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
bi=3
wi=2
w=5
w-wi =3

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
21

Example (9)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0

2
0
3

3
0
3

4
0
3

5
0
3

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
bi=4
wi=3
w=1
w-wi =-2

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
22

Example (10)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0

2
0
3
3

3
0
3

4
0
3

5
0
3

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
bi=4
wi=3
w=2
w-wi =-1

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
23

Example (11)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0

2
0
3
3

3
0
3
4

4
0
3

5
0
3

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
bi=4
wi=3
w=3
w-wi =0

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
24

Example (12)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0

2
0
3
3

3
0
3
4

4
0
3
4

5
0
3

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
bi=4
wi=3
w=4
w-wi =1

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
25

Example (13)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0

2
0
3
3

3
0
3
4

4
0
3
4

5
0
3
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
bi=4
wi=3
w=5
w-wi =2

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
26

Example (14)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0

2
0
3
3
3

3
0
3
4
4

4
0
3
4

5
0
3
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=3
bi=5
wi=4
w= 1..3

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
27

Example (15)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0

2
0
3
3
3

3
0
3
4
4

4
0
3
4
5

5
0
3
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=3
bi=5
wi=4
w= 4
w- wi=0

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
28

Example (16)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0

2
0
3
3
3

3
0
3
4
4

4
0
3
4
5

5
0
3
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=3
bi=5
wi=4
w= 5
w- wi=1

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
29

Example (17)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=4
bi=6
wi=5
w= 1..4

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
30

Example (18)
i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=4
bi=6
wi=5
w= 5
w- wi=0

if wi <= w // item i can be part of the solution

if bi + V[i-1,w-wi] > V[i-1,w]
V[i,w] = bi + V[i-1,w- wi]
else
V[i,w] = V[i-1,w]
else V[i,w] = V[i-1,w] // wi > w
31

Exercise

P303 8.2.1 (a).

How to find out which items are in the optimal subset?

32

Comments

This algorithm only finds the max possible value

that can be carried in the knapsack
i.e., the value in V[n,W]

To know the items that make this maximum value,

an addition to this algorithm is necessary

33

How to find actual Knapsack

Items

All of the information we need is in the table.

V[n,W] is the maximal value of items that can be
placed in the Knapsack.
Let i=n and k=W
if V[i,k] V[i1,k] then
mark the ith item as in the knapsack
i = i1, k = k-wi
else
i = i1 // Assume the ith item is not in the knapsack
// Could it be in the optimally packed
knapsack?

34

Finding the Items

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=4
k= 5
bi=6
wi=5
V[i,k] = 7
V[i1,k] =7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then
mark the ith item as in the knapsack
i = i1, k = k-wi
else
i = i1

35

Finding the Items (2)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=4
k= 5
bi=6
wi=5
V[i,k] = 7
V[i1,k] =7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then
mark the ith item as in the knapsack
i = i1, k = k-wi
else
i = i 1

36

Finding the Items (3)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=3
k= 5
bi=5
wi=4
V[i,k] = 7
V[i1,k] =7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then
mark the ith item as in the knapsack
i = i1, k = k-wi
else
i = i 1

37

Finding the Items (4)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=2
k= 5
bi=4
wi=3
V[i,k] = 7
V[i1,k] =3
k wi=2

mark the ith item as in the knapsack

i = i1, k = k-wi
else
i = i 1

38

Finding the Items (5)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

i=1
k= 2
bi=3
wi=2
V[i,k] = 3
V[i1,k] =0
k wi=0

mark the ith item as in the knapsack

i = i1, k = k-wi
else
i = i 1

39

Finding the Items (6)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then

i=0
k= 0

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

The optimal
knapsack
should contain
{1, 2}

mark the nth item as in the knapsack

i = i1, k = k-wi
else
i = i1

40

Finding the Items (7)

i\W
0
1
2
3
4

0
0
0
0
0
0

1
0
0
0
0
0

2
0
3
3
3
3

3
0
3
4
4
4

4
0
3
4
5
5

5
0
3
7
7
7

i=n, k=W
while i,k > 0
if V[i,k] V[i1,k] then

Items:
1: (2,3)
2: (3,4)
3: (4,5)
4: (5,6)

The optimal
knapsack
should contain
{1, 2}

mark the nth item as in the knapsack

i = i1, k = k-wi
else
i = i1

41

Memorization (Memory Function Method)

Goal:
Solve only subproblems that are necessary and solve it only once

Memorization is another way to deal with overlapping subproblems

in dynamic programming
With memorization, we implement the algorithm recursively:
If we encounter a new subproblem, we compute and store the solution.
If we encounter a subproblem we have seen, we look up the answer

Most useful when the algorithm is easiest to implement recursively

Especially if we do not need solutions to all subproblems.

42

0-1 Knapsack Memory Function Algorithm

MFKnapsack(i, w)
for i = 1 to n
if V[i,w] < 0
for w = 1 to W
if w < wi
V[i,w] = -1
value = MFKnapsack(i-1, w)
for w = 0 to W
V[0,w] = 0
for i = 1 to n
V[i,0] = 0

else
value = max(MFKnapsack(i-1, w),
bi + MFKnapsack(i-1, w-wi))
V[i,w] = value
return V[i,w]

43

Conclusion

Dynamic programming is a useful technique of

solving certain kind of problems
When the solution can be recursively described in
terms of partial solutions, we can store these
partial solutions and re-use them as necessary
(memorization)
Running time of dynamic programming algorithm
vs. nave algorithm:
0-1 Knapsack problem: O(W*n) vs. O(2n)

44

In-Class Exercise

45

Brute-Force Approach

Design and Analysis of Algorithms - Chapter 8

46
46

Dynamic-Programming Approach

(1) SMaxV(0) = 0
(2) MaxV(0) = 0
(3) for i=1 to n
(4) SMaxV(i) = max(SmaxV(i-1)+xi, 0)

(5) MaxV(i) = max(MaxV(i-1), SMaxV(i))

(6) return MaxV(n)

Run the algorithm on the following example instance:

30, 40, -100, 10, 20, 50, -60, 90, -180, 100

47
47