The Floyd-WarshallAlgorithm and the Asymmetric TSP

Simple item page
dc.creatorKleiman, Howard
dc.date2004-10-16
dc.date.accessioned2026-07-07T05:13:19Z
dc.date.available2026-07-07T05:13:19Z
dc.descriptionWe improve proofs in "The Floyd-Warshall Algorithm, the AP and the TSP (III). We also simplify the method for obtaining a good upper bound for an optimal solution.
dc.descriptionPDF, 105 pages
dc.identifierhttps://arxiv.org/abs/math/0410361
dc.identifierhttp://arxiv.org/abs/math/0410361
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72902
dc.subjectCombinatorics
dc.subject05
dc.titleThe Floyd-WarshallAlgorithm and the Asymmetric TSP
dc.typetext

Files

Collections

arXiv