Three Approaches to Enumerate All Permutations for the Traveling Salesman Problem with Five Cities
Problem Statement A traveling salesman must visit five cities. Determine the order of visits that minimizes total travel time. Analysis Direct Solution Enumerate all posisble visit orders and compute the shortest time. This reduces to generating all permutations of five cities. Label the cities as {...