Reproduce “A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.