An Algorithm for Performing Traveling Salesman on Given N Points

Bahman Mashood

doi:10.47191/ijmcr/v11i6.01

International Journal of Mathematics And Computer Research

Articles

PDF

HTML

1019

Total

257

Citations

Share

Peer Review*

Title : An Algorithm for Performing Traveling Salesman on Given N Points

Bahman Mashood

Vol 11 No 06 (2023): VOLUME 11 ISSUE 06

Article Date Published : 13 June 2023 | Page No.: 3465-3468 | Google Scholar

DOI https://doi.org/10.47191/ijmcr/v11i6.01

Keywords
Article Content
References
Downloads
Citation Tools

Keywords:-

Keywords: .

Article Content:-

Abstract

Given N points in some General metric space M, we want to connect them so that from each point we can access any other points such that the union of all connecting lines have minimal length.

References:-

References

Michael .Spivak, ”Introduction to Differential Geometry” Volume one Second Edition Publish or Perish ,Inc.1979

Ed.Tymchatyn, ”On Theory of Continum”.Lectures at Department of Mathematics, Univercity of Saskatchewan.1982

Downloads

Citation Tools

How to Cite

Mashood, B. (2023). An Algorithm for Performing Traveling Salesman on Given N Points. International Journal Of Mathematics And Computer Research, 11(06), 3465-3468. https://doi.org/10.47191/ijmcr/v11i6.01

Download Citation