A branch and bound algorithm for the robust spanning tree problem with interval data
A branch and bound algorithm for the robust spanning tree problem with interval data
The Mathematics of Phylogenomics
SIAM Review
The minimum evolution problem: Overview and classification
Networks - Special Issue on Trees
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
Networks - Special Issue on Trees
The Robust Traveling Salesman Problem with Interval Data
Transportation Science
Optimal solutions for the balanced minimum evolution problem
Computers and Operations Research
The Balanced Minimum Evolution Problem
INFORMS Journal on Computing
On the complexity of the robust spanning tree problem with interval data
Operations Research Letters
The robust spanning tree problem with interval data
Operations Research Letters
Hi-index | 0.04 |
We investigate the Robust Deviation Balanced Minimum Evolution Problem (RDBMEP), a combinatorial optimization problem that arises in computational biology when the evolutionary distances from taxa are uncertain and varying inside intervals. By exploiting some fundamental properties of the objective function, we present a mixed integer programming model to exactly solve instances of the RDBMEP and discuss the biological impact of uncertainty on the solutions to the problem. Our results give perspective on the mathematics of the RDBMEP and suggest new directions to tackle phylogeny estimation problems affected by uncertainty.