Reproduce “On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims” 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

Moustapha Diaby, Mark H. Karwan, Lei Sun

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.