Reproduce “The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.