Question 11
TSP Distance matrix for 6 cities (A to F) and sorted segments are provided in the figure. For each city the distances to other cities are listed in ascending order. For example, Column 1 shows the distance from A to D as 14, A to B as 26 and so on.
Note 1: A segment is a two-way edge between a pair of cities. Note 2: In TSP BnB, after adding or dropping a permanent-segment, first, infer new (included/excluded) permanent-segments, then compute the lower bound. Use the above information to answer the sub-questions.
Infer all the permanently included and permanently excluded segments in the node (S0, BC, AD, BE, ~AB, AF). Enter the total number of permanently included segments followed by the total number of permanently excluded segments as a comma separated list. Enter two natural numbers as a comma separated list. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 17,42 Answers Case Sensitive : No