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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.
Text in Word 2000, math in Math Type 4.0, sent in a PDF file written in Acrobat 5.0, 63 pages

Keywords

Combinatorics, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/62827

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0112052
 http://arxiv.org/abs/math/0112052

Collections

arXiv