The Floyd-Warshall Algorithm, the AP and the TSP, Part II
<|reference_start|>The Floyd-Warshall Algorithm, the AP and the TSP, Part II: 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.<|reference_end|>
@article{kleiman2001the,
    title={The Floyd-Warshall Algorithm, the AP and the TSP, Part II},
    author={Howard Kleiman},
    journal={arXiv preprint arXiv:math/0112052},
    year={2001},
    archivePrefix={arXiv},
    eprint={math/0112052},
    primaryClass={math.CO cs.DS}
}