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

doi:10.1016/j.cor.2023.106308

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

2023-10-01

0

PRE

AI

DOI：10.1016/j.cor.2023.106308

Original

Original request for help

Save

Abstract

En 中文

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

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

Abstract

Journal

Organization