Enumerating vertices of the balanced minimum evolution polytope

DOI10.1016/J.COR.2019.05.001MaRDI QIDQ2003580zbMATH OpenOpenAlexWikidataFDO

Authors Daniele Catanzaro, Raffaele Pesenti

Publication date 9 July 2019

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

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

zbMATH Keywords

balanced minimum evolution polytopeparallel enumerationphylogeneticsPrüfer codingtree codesunrooted binary tree enumeration

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Problems related to evolution (92D15) Linear codes (general theory) (94B05)

Recommendations

• On the balanced minimum evolution polytope
• Facets of the balanced minimal evolution polytope
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• Enumerating minimal subset feedback vertex sets
• Enumerating minimal subset feedback vertex sets
• Efficient enumeration of the vertices of polyhedra associated with network LP's
• The balanced minimum evolution problem
• scientific article; zbMATH DE number 4108497

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• Approximating the balanced minimum evolution problem
• Coxeter‐associahedra
• Facets of the balanced minimal evolution polytope
• Geometry of the space of phylogenetic trees
• scientific article; zbMATH DE number 2171552 (Why is no real title available?)
• scientific article; zbMATH DE number 2195724 (Why is no real title available?)
• On coding labeled trees
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• polymake: a framework for analyzing convex polytopes
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• The balanced minimum evolution problem
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• The minimum evolution problem: Overview and classification
• The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation

Cited in

(8)

• On the approximability of the fixed-tree balanced minimum evolution problem
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• A tutorial on the balanced minimum evolution problem
• Facets of the balanced minimal evolution polytope
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• Optimizing over path-length matrices of unrooted binary trees
• Pointed order polytopes: studying geometrical aspects of the polytope of bi-capacities
• On the balanced minimum evolution polytope

Describes a project that uses

Uses Software

• polymake

This page was built for publication: Enumerating vertices of the balanced minimum evolution polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003580)