[2409.11563] Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Combinatorics

arXiv:2409.11563 (math)
[Submitted on 17 Sep 2024]

Title:Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem

Authors:Sergey Kurapov, Maxim Davidovsky, Svetlana Polyuga
View PDF
Abstract:The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle based on ring summation of isometric cycles of a graph is presented. Based on the matrix of distances between vertices, the weight of each cycle is determined as an additive sum of the weights of its edges. To construct an optimal route of a graph, the basic idea of finding an optimal route between four vertices is used. Further successive constructions are aimed at joining an adjacent isometric cycle with an increase in the number of vertices by one unit. The recursive process continues until all vertices of the graph are connected. Based on the introduced mathematical apparatus, the monography presents a new algorithm for solving the symmetric Traveling salesman problem. Some examples of solving the problem are provided.
Comments: 46 pages, 32 figures, a preprint of monography, in Ukrainian language
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
Cite as: arXiv:2409.11563 [math.CO]
  (or arXiv:2409.11563v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2409.11563

Submission history

From: Sergey Kurapov [view email]
[v1] Tue, 17 Sep 2024 21:26:41 UTC (1,749 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2024-09
Change to browse by:
cs
cs.DM
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)