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)

zbMATH Keywords

combinatorial optimizationphylogeneticsinteger programmingpolyhedral combinatoricsbalanced minimum evolutiondistance methodsKraft's equalityunrooted binary treestree realizationpath-length matricesbranch-\& -cutBuneman's four-point conditions

Mathematics Subject Classification ID

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

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)