The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
From MaRDI portal
Publication:6521267
arXiv2402.07061MaRDI QIDQ6521267
Author name not available (Why is that?)
No records found.
This page was built for publication: The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6521267)