The Floyd-Warshall Algorithm, the AP and the TSP, Part II
Kleiman, Howard
Original · EN
In math.CO/0111309, we used admissible permutations and a variant of the Floyd-Warshall Algorithm to obtain an optimal solution to the Assignment Problem and an approximate solution to the Traveling Salesman Problem. Here we give a large, detailed illustration of how the algorithms are applied.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.