An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

下载PDF

导出

摘要 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.

作者 Janusz Czopik

机构地区 Sugar Land

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

关键词 TRAVELING SALESMAN ASSIGNMENT Problem POLYNOMIAL Time HUNGARIAN Algorithm Traveling Salesman Assignment Problem Polynomial Time Hungarian Algorithm

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

引文网络
相关文献

1Tianlong Gu,Liang Chang,Zhoubo Xu.A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs[J].International Journal of Communications, Network and System Sciences,2011,4(2):111-121. 被引量：1

American Journal of Computational Mathematics

2019年第2期

浏览历史

内容加载中请稍等...

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

相关作者

相关机构

相关主题

浏览历史