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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kurapov, Sergey, Davidovsky, Maxim, Polyuga, Svetlana
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2409.11563