The Floyd-WarshallAlgorithm and the Asymmetric TSP

2004/10/16 by Howard Kleiman, Kleiman, Howard
Computer Science · Mathematics · #05 #Combinatorics (math.CO) #Constraint Satisfaction and Optimization #FOS: Mathematics #Metaheuristic Optimization Algorithms Research #Optimization and Search Problems #math.CO #msc:05

paper · pdf · doi:10.48550/arxiv.math/0410361

PDF, 105 pages

arxiv created 2004/10/16 · openalex publication_date 2004/10/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We 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.

Related

• The Floyd-Warshall Algorithm, the AP and the TSP III
• The Floyd-Warshall Algorithm, the AP and the TSP, Part II
• The Floyd-Warshall Algorithm, the AP and the TSP
• The Asymmetric Traveling Salesman Problem
• Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP