The balanced minimum evolution problem under uncertain data

DOI10.1016/j.dam.2013.03.012zbMath1288.90071OpenAlexW2171200735MaRDI QIDQ2446823

Raffaele Pesenti, Martine Labbé, Daniele Catanzaro

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.012

zbMATH Keywords

combinatorial optimizationcombinatorial inequalitiesrobust optimizationnetwork designcomputational biologybalanced minimum evolutionBender's decompositionKraft equality

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A tutorial on the balanced minimum evolution problem, On the approximability of the fixed-tree balanced minimum evolution problem

Cites Work

• Unnamed Item
• Approximating the balanced minimum evolution problem
• Robust discrete optimization and its applications
• On the complexity of the robust spanning tree problem with interval data
• A robust model for finding optimal evolutionary tree
• A molecular sequence metric and evolutionary trees
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• The Balanced Minimum Evolution Problem
• The Mathematics of Phylogenomics
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• The minimum evolution problem: Overview and classification
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• The robust spanning tree problem with interval data