Optimizing over path-length matrices of unrooted binary trees

DOI10.1007/S10107-025-02226-ZMaRDI QIDQ6873497zbMATH OpenFDO

Authors Daniele Catanzaro, Raffaele Pesenti, Allan Sapucaia, Laurence A. Wolsey

Publication date 16 January 2026

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-025-02226-Z

zbMATH Keywords

balanced minimum evolutionbranch-\& -cutBuneman's four-point conditionscombinatorial optimizationdistance methodsinteger programmingKraft's equalitypath-length matricesphylogeneticspolyhedral combinatoricstree realizationunrooted binary trees

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites work

• A branch-price-and-cut algorithm for the minimum evolution problem
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• A note on the metric properties of trees
• A note on the tree realizability of a distance matrix
• A tutorial on the balanced minimum evolution problem
• Approximating the balanced minimum evolution problem
• Branch and bound algorithms to determine minimal evolutionary trees
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• Coxeter‐associahedra
• Cyclic permutations and evolutionary trees
• Distance matrix of a graph and its realizability
• Enumerating vertices of the balanced minimum evolution polytope
• Facets of the balanced minimal evolution polytope
• Geometry of the space of phylogenetic trees
• scientific article; zbMATH DE number 1113975 (Why is no real title available?)
• scientific article; zbMATH DE number 2171552 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• On coding labeled trees
• On the approximability of the fixed-tree balanced minimum evolution problem
• On the balanced minimum evolution polytope
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• Phylogeny. Discrete and random processes in evolution
• Polyhedral geometry of phylogenetic rogue taxa
• Probabilistic machine learning. An introduction
• Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
• The balanced minimum evolution problem
• The balanced minimum evolution problem under uncertain data
• The distance matrix of a graph and its tree realization
• The minimum evolution problem: Overview and classification
• The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation
• The traveling salesman problem. A computational study.
• Two inequalities implied by unique decipherability

Cited in

(1)

• A note on the approximability of the balanced minimum evolution problem

This page was built for publication: Optimizing over path-length matrices of unrooted binary trees

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