1.0Camdemy1.0http://media.usc.edu.twAlgorithm_TravelingSalespersonhttp://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/a/a53e00942081bb24/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare962' frameborder='0' src='http://media.usc.edu.tw/media/e/962' allowfullscreen></iframe>video72040513:59Traveling Salesperson Optimization Problem01The Traveling Salesperson Optimization Problem02A reduced cost matrix03Another reduced matrix04The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.05Another reduced matrix06The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.07Another reduced matrix08The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.09Another reduced matrix010The highest level of a decision tree: If we use arc 3-5 to split, the difference on the lower bounds is 17 + 1 = 18.011A reduced cost matrix if arc (4,6) is included in the solution.012The reduced cost matrix for all solutions with arc 4-6.Total cost reduced: 96 + 3 = 99 (new lower bound).013A reduced cost matrix if arc (4,6) is included in the solution.014The reduced cost matrix for all solutions with arc 4-6.Total cost reduced: 96 + 3 = 99 (new lower bound).015Slide 8016fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/a/a53e00942081bb24/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/a/a53e00942081bb24/cover.jpghttp://media.usc.edu.tw/sysdata/doc/a/a53e00942081bb24/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/a/a53e00942081bb241