An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem

Czopik, Janusz (2019) An Application of the Hungarian Algorithm to Solve Traveling Salesman Problem. American Journal of Computational Mathematics, 09 (02). pp. 61-67. ISSN 2161-1203

[thumbnail of AJCM_2019061015215148.pdf]

Text
AJCM_2019061015215148.pdf - Published Version
Download (373kB)

Official URL: https://doi.org/10.4236/ajcm.2019.92005

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.

Item Type:	Article
Subjects:	GO STM Archive > Mathematical Science
Depositing User:	Unnamed user with email support@gostmarchive.com
Date Deposited:	15 Jun 2023 08:11
Last Modified:	06 Sep 2024 08:19
URI:	http://journal.openarchivescholar.com/id/eprint/1154

Actions (login required)

: View Item