Mathematics – Combinatorics
Scientific paper
2001-11-29
Mathematics
Combinatorics
Text in Word 2000, math in MathType 4.0, sent in a PDF file written in Acrobat 5.0, 23 pages
Scientific paper
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.
No associations
LandOfFree
The Floyd-Warshall Algorithm, the AP and the TSP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Floyd-Warshall Algorithm, the AP and the TSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Floyd-Warshall Algorithm, the AP and the TSP will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-577867