IMPS_2017/FILES/12_07

• 12_07.pdf, Lecture notes (PDF);
• 12_07.ppt, Lecture notes (PowerPoint);
• capitals_distance.m, distance matrix for the capitals example;
• capitals_label.m, labels for the capitals example.
• capitals.m, names, latitudes and longitudes of capitals.
• capitals_route.m, computes a TSP route for the capitals problem using the nearest neighbor method.
• capitals_route_test.m, sets up data and calls capitals_route.
• capitals_route.txt, a list of the TSP itinerary created by capitals_route.m.
• capitals_timing.m, times small (sizes 5 through 12) versions of the capital problem solved with brute force.
• city_dist_table.m, computes the capital city distance table.
• nextperm.m, computes the next permutation.
• trip_distance.m, computes the length of a TSP route.
• tsp_2opt.m, improves a TSP route by considering the exchange of two edges.
• tsp_brute.m, computes a TSP route by brute force.
• tsp_nearest.m, computes a TSP route by the nearest neighbor method.
• tsp_random.m, computes a TSP route by random sampling.
• v_distance.m, distance matrix for the five city example;
• v_label.m, labels for the five city example.