An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem  

作　　者：Janusz Czopik 

机构地区：[1]Sugar Land, USA

出　　处：《American Journal of Computational Mathematics》2019年第2期61-67,共7页美国计算数学期刊（英文）

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

关 键 词：TRAVELING SALESMAN ASSIGNMENT Problem POLYNOMIAL Time HUNGARIAN Algorithm 

分 类 号：TP30[自动化与计算机技术—计算机系统结构]