A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem

Abstract

We build upon recent theoretical advances in the Balanced Minimum Evolution Problem (BMEP) to design a new massively parallel exact solution algorithm that proves to be up to one order of magnitude faster than the current state-of-the-art under the same computing settings and environment.