A branch-price-and-cut algorithm for the minimum evolution problem
From MaRDI portal
(Redirected from Publication:319451)
Recommendations
Cites work
- scientific article; zbMATH DE number 51444 (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?)
- scientific article; zbMATH DE number 3383914 (Why is no real title available?)
- A fast algorithm for constructing trees from distance matrices
- A molecular sequence metric and evolutionary trees
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A robust model for finding optimal evolutionary tree
- Approximating the balanced minimum evolution problem
- Chemical trees enumeration algorithms
- Cyclic permutations and evolutionary trees
- Generalized network design problems. Modeling and optimization.
- Handbook of metaheuristics
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On the consistency of the minimum evolution principle of phylogenetic inference
- Reverse search for enumeration
- The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
- The Mathematics of Phylogenomics
- The balanced minimum evolution problem
- The complexity of the network design problem
Cited in
(11)- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- The balanced minimum evolution problem
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- A tutorial on the balanced minimum evolution problem
- The balanced minimum evolution problem under uncertain data
- Level-1 phylogenetic networks and their balanced minimum evolution polytopes
- The minimum evolution problem: Overview and classification
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- Approximating the balanced minimum evolution problem
- A branch-and-price-and-cut method for computing an optimal bramble
- On the approximability of the fixed-tree balanced minimum evolution problem
This page was built for publication: A branch-price-and-cut algorithm for the minimum evolution problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319451)