An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem - American Journal of Computational Mathematics

AJCM > Vol.9 No.2, June 2019

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem ()

HTML

Download as PDF (Size: 364KB) PP. 61-67

DOI: 10.4236/ajcm.2019.92005 1,377 Downloads 3,677 Views Citations

Author(s)

Janusz Czopik

Affiliation(s)

Sugar Land, USA.

ABSTRACT

In this paper we applicate the Hungarian algorithm for assignment problem to solve traveling salesman problem. Tree examples of application of algorithm are included.

KEYWORDS

Traveling Salesman, Assignment Problem, Polynomial Time, Hungarian Algorithm

Share and Cite:

Czopik, J. (2019) An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem. American Journal of Computational Mathematics, 9, 61-67. doi: 10.4236/ajcm.2019.92005.

Journals Menu