The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heimann, Sophia, Hoang, Hung P., Hougardy, Stefan
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Discrete Mathematics Combinatorics 68W25, 68W40, 68Q25, 90C27 F.2.2; G.2.1; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2402.07061