A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We introduce a strong extended formulation of the convex recoloring problem on a tree, which has an application in analyzing phylogenetic trees. The extended formulation has only a polynomial number of constraints, but dominates the conventional formulation and the exponentially many valid inequalities introduced by Campêlo et al. (Math Progr 156:303-330, 2016). We show that all valid inequali-Electronic supplementary material The online version of this article (123 530 S. Chopra et al. tiesdoi:10.1007/s10107-016-1094-3 fatcat:3yotlteogjbixehzcfchuuo2ty