Kuhn, H. (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2, 83-97. https://doi.org/10.1002/nav.3800020109
has been cited by the following article:
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.