{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_TravelingSalesperson","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/a\/a53e00942081bb24\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare962' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/962' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"13:59","index":{"item_1":{"title":"Traveling Salesperson Optimization Problem","time":"0","indent":"0","sn":"1"},"item_2":{"title":"The Traveling Salesperson Optimization Problem","time":"22380","indent":"0","sn":"2"},"item_3":{"title":"A reduced cost matrix","time":"115530","indent":"0","sn":"3"},"item_4":{"title":"Another reduced matrix","time":"185230","indent":"0","sn":"4"},"item_5":{"title":"The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.","time":"229080","indent":"0","sn":"5"},"item_6":{"title":"Another reduced matrix","time":"250980","indent":"0","sn":"6"},"item_7":{"title":"The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.","time":"269630","indent":"0","sn":"7"},"item_8":{"title":"Another reduced matrix","time":"290280","indent":"0","sn":"8"},"item_9":{"title":"The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.","time":"313580","indent":"0","sn":"9"},"item_10":{"title":"Another reduced matrix","time":"363880","indent":"0","sn":"10"},"item_11":{"title":"The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.","time":"421280","indent":"0","sn":"11"},"item_12":{"title":"A reduced cost matrix if arc (4,6) is included in the solution.","time":"427330","indent":"0","sn":"12"},"item_13":{"title":"The reduced cost matrix for all solutions with arc 4-6.Total cost reduced: 96 + 3 = 99 (new lower bound).","time":"498830","indent":"0","sn":"13"},"item_14":{"title":"A reduced cost matrix if arc (4,6) is included in the solution.","time":"503630","indent":"0","sn":"14"},"item_15":{"title":"The reduced cost matrix for all solutions with arc 4-6.Total cost reduced: 96 + 3 = 99 (new lower bound).","time":"517180","indent":"0","sn":"15"},"item_16":{"title":"Slide 8","time":"529630","indent":"0","sn":"16"}},"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\/a\/a53e00942081bb24\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/a\/a53e00942081bb24\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/a\/a53e00942081bb24\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/a\/a53e00942081bb24","status":true}