The Floyd-Warshall Algorithm, the AP and the TSP, Part II

Simple item page
dc.creatorKleiman, Howard
dc.date2001-12-06
dc.date.accessioned2026-07-07T04:45:02Z
dc.date.available2026-07-07T04:45:02Z
dc.descriptionIn 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.
dc.descriptionText in Word 2000, math in Math Type 4.0, sent in a PDF file written in Acrobat 5.0, 63 pages
dc.identifierhttps://arxiv.org/abs/math/0112052
dc.identifierhttp://arxiv.org/abs/math/0112052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62827
dc.subjectCombinatorics
dc.subjectData Structures and Algorithms
dc.titleThe Floyd-Warshall Algorithm, the AP and the TSP, Part II
dc.typetext

Files

Collections

arXiv