TITLE:
An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem
AUTHORS:
Janusz Czopik
KEYWORDS:
Traveling Salesman, Assignment Problem, Polynomial Time, Hungarian Algorithm
JOURNAL NAME:
American Journal of Computational Mathematics,
Vol.9 No.2,
June
11,
2019
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.