A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem

Daniele Catanzaro (), Martin Frohn, Olivier Gascuel and Raffaele Pesenti
Additional contact information
Daniele Catanzaro: Université catholique de Louvain, LIDAM/CORE, Belgium

No 2023001, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: We build upon recent theoretical advances on 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. We also investigate, for the first time, the theoretical connections between numerical stability and statistical consistency of the BMEP and we show that some rescaling techniques introduced to numerically stabilize the problem may affect negatively the statistical consistency of the optimal solution to the problem.

Keywords: Combinatorial optimization; integer programming; network realization; network design; balanced minimum evolution; phylogenetics; distance methods; parallel branch-and-bound (search for similar items in EconPapers)
Pages: 33
Date: 2023-01-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://dial.uclouvain.be/pr/boreal/en/object/bore ... tastream/PDF_01/view (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2023001

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().