An extended formulation of the convex recoloring problem on a tree

AbstractWe 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 inequalities introduced by Campêlo et al. can be derived from the extended formulation. We also show that the natural restriction of the extended formulation provides a complete inequality description of the polytope of subtrees of a tree. The solution time using the extended formulation is much smaller than that with the conventional formulation. Moreover the extended formulation solves all the problem instances attempted in Campêlo et al. (2016) and larger sized instances at the root node of the branch-and-bound tree without branching.

[1]  Gérard Cornuéjols,et al.  Extended formulations in combinatorial optimization , 2013, Ann. Oper. Res..

[2]  Michael R. Fellows,et al.  Connected Coloring Completion for General Graphs: Algorithms and Complexity , 2007, COCOON.

[3]  Yiming Wang,et al.  On imposing connectivity constraints in integer programs , 2017, Mathematical Programming.

[4]  Laurence A. Wolsey,et al.  Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.

[5]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[6]  Dieter Kratsch,et al.  Convex Recoloring Revisited: Complexity and Exact Algorithms , 2009, COCOON.

[7]  Sagi Snir,et al.  Efficient Approximation of Convex Recolorings , 2005, APPROX-RANDOM.

[8]  Rolf Niedermeier,et al.  Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems , 2008, TAMC.

[9]  Frank Kammer,et al.  The complexity of minimum convex coloring , 2008, Discret. Appl. Math..

[10]  M. R. Rao,et al.  The partition problem , 1993, Math. Program..

[11]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[12]  Yoshiko Wakabayashi,et al.  On the Complexity of Solving or Approximating Convex Recoloring Problems , 2013, COCOON.

[13]  Sagi Snir,et al.  Partial convex recolorings of trees and galled networks: Tight upper and lower bounds , 2011, TALG.

[14]  Yoshiko Wakabayashi,et al.  Convex Recoloring of Paths , 2011, Electron. Notes Discret. Math..

[15]  Michel X. Goemans,et al.  The Steiner tree polytope and related polyhedra , 1994, Math. Program..

[16]  Sunil Chopra,et al.  Extended formulations for the A-cut problem , 1996, Math. Program..

[17]  Sagi Snir,et al.  Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms , 2005, WADS.

[18]  Yoshiko Wakabayashi,et al.  The convex recoloring problem: polyhedra, facets and computational experiments , 2016, Math. Program..

[19]  Michele Conforti,et al.  Subgraph polytopes and independence polytopes of count matroids , 2015, Oper. Res. Lett..

[20]  Dror Rawitz,et al.  Improved Approximation Algorithm for Convex Recoloring of Trees , 2005, WAOA.

[21]  V. Kaibel.  Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.

[22]  Yoshiko Wakabayashi,et al.  Polyhedral studies on the convex recoloring problem , 2013, Electron. Notes Discret. Math..