Reproduce “A Compact Weight-Space Integer Programming Formulation for Balanced Minimum Evolution” 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
Leonid Chindelevitch, Matthew Penn, Samir Bhatt
The authors formulate balanced minimum evolution (BME) in pairwise weights, making its objective linear with binomial n choose 2 variables rather than order n cubed. They show that specified tree splits and an entropy constraint uniquely determine a tree’s weights. The compact solver certified some 20-taxon cases, but a distance-indexed competitor certified more broadly and was faster on a benchmark.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.