The Floyd-Warshall Algorithm, the AP and the TSP, Part II
Combinatorics
2007-05-23 v1 Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.math/0112052,
title = {The Floyd-Warshall Algorithm, the AP and the TSP, Part II},
author = {Howard Kleiman},
journal= {arXiv preprint arXiv:math/0112052},
year = {2007}
}
Comments
Text in Word 2000, math in Math Type 4.0, sent in a PDF file written in Acrobat 5.0, 63 pages