{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Branch-and-Bound 0\/1 Knapsack","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c01d7fb12e705531\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare3059' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/3059' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"38:55","index":{"item_1":{"title":"0\/1 KnapsackProblem","time":"0","indent":"0","sn":"1"},"item_2":{"title":"All approaches for 0\/1 Knapsack Problem:","time":"9707","indent":"0","sn":"2"},"item_3":{"title":"Brute-Force Search or Exhaustive Search: 2n","time":"246638","indent":"0","sn":"3"},"item_4":{"title":"The 0\/1 Knapsack Problem","time":"403836","indent":"0","sn":"4"},"item_5":{"title":"e.g. n = 6, M = 34A feasible solution: X1 = 1, X2 = 1, X3 = 0, X4 = 0, X5 = 0, X6 = 0-(P1+P2) = -16  (upper bound)Any solution higher than -16 cannot be an optimal solution.","time":"532801","indent":"0","sn":"5"},"item_6":{"title":"Relax the Restriction","time":"792865","indent":"0","sn":"6"},"item_7":{"title":"Upper Bound and Lower Bound","time":"850598","indent":"0","sn":"7"},"item_8":{"title":"Relax the Restriction","time":"918697","indent":"0","sn":"8"},"item_9":{"title":"e.g. n = 6, M = 34A feasible solution: X1 = 1, X2 = 1, X3 = 0, X4 = 0, X5 = 0, X6 = 0-(P1+P2) = -16  (upper bound)Any solution higher than -16 cannot be an optimal solution.","time":"919464","indent":"0","sn":"9"},"item_10":{"title":"Relax the Restriction","time":"926497","indent":"0","sn":"10"},"item_11":{"title":"Upper Bound and Lower Bound","time":"926964","indent":"0","sn":"11"},"item_12":{"title":"e.g. n = 6, M = 34A feasible solution: X1 = 1, X2 = 1, X3 = 0, X4 = 0, X5 = 0, X6 = 0-(P1+P2) = -16  (upper bound)Any solution higher than -16 cannot be an optimal solution.","time":"1194095","indent":"0","sn":"12"},"item_13":{"title":"Expand the node with the best lower bound.","time":"1276327","indent":"0","sn":"13"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c01d7fb12e705531\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c01d7fb12e705531\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c01d7fb12e705531\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c01d7fb12e705531","status":true}