The Floyd-Warshall Algorithm, the AP and the TSP
<|reference_start|>The Floyd-Warshall Algorithm, the AP and the TSP: We use admissible permutations and a variant of the Floyd-Warshall algorithm to obtain an optimal solution to the Assignment Problem. Using another variant of the F-W algorithm, we obtain an approximate solution to the Traveling Salesman Problem. We also give a sufficient condition for the approximate solution to be an optimal solution.<|reference_end|>
@article{kleiman2001the,
    title={The Floyd-Warshall Algorithm, the AP and the TSP},
    author={Howard Kleiman},
    journal={arXiv preprint arXiv:math/0111309},
    year={2001},
    archivePrefix={arXiv},
    eprint={math/0111309},
    primaryClass={math.CO cs.DS}
}