Share This Article:

An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

Full-Text HTML Download Download as PDF (Size:364KB) PP. 61-67
DOI: 10.4236/ajcm.2019.92005    309 Downloads   545 Views
Author(s)

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.

Cite this paper

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.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.