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

DOI10.1016/j.cor.2023.106308OpenAlexW4380154418MaRDI QIDQ6106606

Olivier Gascuel, Raffaele Pesenti, Martin Frohn, Daniele Catanzaro

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106308

zbMATH Keywords

integer programmingcombinatorial optimizationnetwork designbalanced minimum evolution problemparallel branch-and-bound

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• A `stochastic safety radius' for distance-based tree reconstruction
• Facets of the balanced minimal evolution polytope
• A branch-price-and-cut algorithm for the minimum evolution problem
• Approximating the balanced minimum evolution problem
• Generalized network design problems. Modeling and optimization.
• Polyhedral geometry of phylogenetic rogue taxa
• Robustness of phylogenetic inference based on minimum evolution
• The full Steiner tree problem
• On the balanced minimum evolution polytope
• Branch and bound algorithms to determine minimal evolutionary trees
• The Steiner tree problem
• Steiner minimal trees
• A note on the metric properties of trees
• Cyclic permutations and evolutionary trees
• Advances in Steiner trees
• Enumerating vertices of the balanced minimum evolution polytope
• An information theory perspective on the balanced minimum evolution problem
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• On coding labeled trees
• A tutorial on the balanced minimum evolution problem
• The Balanced Minimum Evolution Problem
• Generalized Connectivity of Graphs
• An algorithm for tree-realizability of distance matrices^∗
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• Spanning Trees and Optimization Problems
• Subtree transfer operations and their induced metrics on evolutionary trees

This page was built for publication: A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem