Lesson 4

Backtracking and Branch- and-bound

Topics

  • All Topics
  • Sum of subsets

    1 Explain sum of subset problem

    Explain sum of subset problem, Find all possible subsets of weight that sum to m, let n =6, m = 30, and w[1:6] = {5, 10, 12, 13, 15, 18).

    Answer: ... (more)
    4 Write an algorithm of sum of subsets.

    Write an algorithm of sum of subsets. Solve following problem and draw portion of state space tree M = 35, W = (5, 7, 10, 12, 15, 18, 20)

    Answer: ... (more)
    5 Write and explain sum of subset algorithm

    Write and explain sum of subset algorithm for n = 5, W = {2, 7, 8, 9, 15} M = 17

    Answer: ... (more)
    6 Sum of Subsests

    Write and explain sum of subset algorithm for n = 5, W = {2, 7, 8, 9, 15} M = 17

    1. Given positive numbers (weight) w_i where (1<=i<=n) and m.

    2. This problem calls for finding all subsets of w_i whose sum ...

    (more)