On the balanced minimum evolution polytope
From MaRDI portal
Publication:783026
DOI10.1016/j.disopt.2020.100570zbMath1506.90274OpenAlexW3007262143MaRDI QIDQ783026
Raffaele Pesenti, Daniele Catanzaro, Laurence A. Wolsey
Publication date: 30 July 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2020.100570
facet-defining inequalitiespolyhedral combinatoricsbalanced minimum evolutionenumeration of treesKraft's equalitymanifold of unrooted binary trees
Trees (05C05) Problems related to evolution (92D15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (4)
A tutorial on the balanced minimum evolution problem ⋮ An information theory perspective on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ On the approximability of the fixed-tree balanced minimum evolution problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- Facets of the balanced minimal evolution polytope
- Approximating the balanced minimum evolution problem
- Geometry of the space of phylogenetic trees
- The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
- The Balanced Minimum Evolution Problem
- The complexity of the network design problem
- A few logs suffice to build (almost) all trees (I)
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- The minimum evolution problem: Overview and classification
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: On the balanced minimum evolution polytope