Reproduce “Complexity of branch-and-bound and cutting planes in mixed-integer optimization” 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
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.