{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Branch-and-Bound TSP Part-1","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/6\/6388d6acdc2d00b4\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare3040' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/3040' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"24:09","index":{"item_1":{"title":"Traveling Salesperson Optimization Problem","time":"0","indent":"0","sn":"1"},"item_2":{"title":"The Traveling Salesperson Optimization Problem","time":"18753","indent":"0","sn":"2"},"item_3":{"title":"Step 1: A reduced cost matrix","time":"341583","indent":"0","sn":"3"},"item_4":{"title":"Step 2.1: Choose an arc with 0 cost.","time":"553148","indent":"0","sn":"4"},"item_5":{"title":"Step 2.2: Without arc (4, 6), the new lower bound is 96+32 = 128","time":"848378","indent":"0","sn":"5"},"item_6":{"title":"Step 3: With arc (4, 6), the new lower bound is 96+3 = 99","time":"919744","indent":"0","sn":"6"},"item_7":{"title":"Solve TSP Problem with Branch-and-Bound","time":"1035076","indent":"0","sn":"7"},"item_8":{"title":"Arc(6, 4) is changed to be infinity since it cannot be included in the solution.Without Arc(4, 6), the lower bound is 96+32=128","time":"1301674","indent":"0","sn":"8"}},"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\/6\/6388d6acdc2d00b4\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/6\/6388d6acdc2d00b4\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/6\/6388d6acdc2d00b4\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/6\/6388d6acdc2d00b4","status":true}