A Massively Parallel Branch-&-Bound 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 3274, LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

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.

Keywords: Combinatorial optimization; Integer programming; Parallel branch-and-bound; Network design; Balanced minimum evolution problem (search for similar items in EconPapers)
Pages: 17
Date: 2023-10-01
Note: In: Computers & Operations Research, 2023, vol. 158, 106308
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:louvrp:3274

DOI: 10.1016/j.cor.2023.106308

Access Statistics for this paper

More papers in LIDAM Reprints 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 ().