2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/62763We 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.Text in Word 2000, math in MathType 4.0, sent in a PDF file written in Acrobat 5.0, 23 pagesCombinatoricsData Structures and Algorithmstext