Co-author The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \geq 5$ FA245 — TSP and vehicle routing 26 Jul 2024 08:30 — Parallel Session
