A branch-price-and-cut algorithm for the minimum evolution problem

DOI10.1016/J.EJOR.2015.02.019zbMATH Open1346.90210OpenAlexW2050374186MaRDI QIDQ319451FDOQ319451

Daniele Catanzaro, Roberto Aringhieri, Raffaele Pesenti, Marco Di Summa

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.02.019

zbMATH Keywords

computational biologysymmetry breakingbranch-price-and-cutcombinatorial inequalitiestree isomorphism

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
• A fast algorithm for constructing trees from distance matrices
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• On the consistency of the minimum evolution principle of phylogenetic inference
• Cyclic permutations and evolutionary trees
• A robust model for finding optimal evolutionary tree
• Reverse search for enumeration
• The complexity of the network design problem
• The balanced minimum evolution problem
• Approximating the balanced minimum evolution problem
• Handbook of metaheuristics
• Chemical trees enumeration algorithms
• A molecular sequence metric and evolutionary trees
• The Mathematics of Phylogenomics
• The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
• Generalized network design problems. Modeling and optimization.

Cited In (6)

• A branch-and-price-and-cut method for computing an optimal bramble
• A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
• On the approximability of the fixed-tree balanced minimum evolution problem
• Level-1 phylogenetic networks and their balanced minimum evolution polytopes
• A tutorial on the balanced minimum evolution problem
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem

Uses Software

• fastDNAml

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)