The Floyd-Warshall Algorithm, the AP and the TSP

Simple item page
dc.creatorKleiman, Howard
dc.date2001-11-29
dc.date.accessioned2026-07-07T04:44:51Z
dc.date.available2026-07-07T04:44:51Z
dc.descriptionWe 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.
dc.descriptionText in Word 2000, math in MathType 4.0, sent in a PDF file written in Acrobat 5.0, 23 pages
dc.identifierhttps://arxiv.org/abs/math/0111309
dc.identifierhttp://arxiv.org/abs/math/0111309
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62763
dc.subjectCombinatorics
dc.subjectData Structures and Algorithms
dc.titleThe Floyd-Warshall Algorithm, the AP and the TSP
dc.typetext

Files

Collections

arXiv