A branch-price-and-cut algorithm for the minimum evolution problem
We study the Minimum Evolution problem (MEP), which arises in Computational Biology. We study the polyhedral combinatorics of the MEP. We present an exact solution approach for the MEP. We study relationships between the MEP and the Balanced Minimum Evolution Problem. We show the statistical consistency of the MEP.
branch-price-and-cut computational biology combinatorial inequalities symmetry breaking tree isomorphism