A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem
Year of publication: |
2023
|
---|---|
Authors: | Catanzaro, Daniele ; Frohn, Martin ; Gascuel, Olivier ; Pesenti, Raffaele |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 158.2023, p. 1-17
|
Subject: | Balanced minimum evolution problem | Combinatorial optimization | Integer programming | Network design | Parallel branch-and-bound | Theorie | Theory | Ganzzahlige Optimierung | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Branch-and-Bound | Branch and Bound |
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
A tutorial on the balanced minimum evolution problem
Catanzaro, Daniele, (2021)
-
A tutorial on the balanced minimum evolution problem
Catanzaro, Daniele, (2022)
- More ...