A Massively Parallel Branch-&-Bound Algorithm for the Balanced Minimum Evolution Problem

Catanzaro, Daniele;Frohn, Martin;Gascuel, Olivier;Pesenti, Raffaele
(2023) Computers & Operations Research — Vol. 158, p. 106308 (2023)

Files

CORE_RP_3274.pdf
  • Open Access
  • Adobe PDF
  • 1.14 MB
Download

Details

Authors
  • Catanzaro, Danieleorcid-logoUCLouvain
    Author
  • Frohn, Martin
    Author
  • Gascuel, Olivier
    Author
  • Pesenti, Raffaele
    Author
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Catanzaro, D., Frohn, M., Gascuel, O., & Pesenti, R. (2023). A Massively Parallel Branch-&-Bound Algorithm for the Balanced Minimum Evolution Problem. Computers & Operations Research, 158, 106308. https://doi.org/10.1016/j.cor.2023.106308 (Original work published 2023)