A branch-and-price algorithm for the rainbow cycle cover problems

[1]  Hikoe Enomoto.  Graph partition problems into cycles and paths , 2001, Discret. Math..

[2]  Ruay-Shiung Chang,et al.  The Minimum Labeling Spanning Trees , 1997, Inf. Process. Lett..

[3]  Raphael Yuster,et al.  Hardness and algorithms for rainbow connection , 2008, J. Comb. Optim..

[4]  Raffaele Cerulli,et al.  The rainbow spanning forest problem , 2018, Soft Comput..

[5]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[6]  William R. Pulleyblank,et al.  On cycle cones and polyhedra , 1989 .

[7]  Paul Erdös,et al.  Vertex coverings by monochromatic cycles and trees , 1991, J. Comb. Theory, Ser. B.

[8]  Xueliang Li,et al.  On the minimum monochromatic or multicolored subgraph partition problems , 2007, Theor. Comput. Sci..

[9]  Güvenç Sahin,et al.  A column generation based algorithm for the robust graph coloring problem , 2017, Discret. Appl. Math..

[10]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[11]  Alain Hertz,et al.  A branch-and-price algorithm for the robust graph coloring problem , 2014, Discret. Appl. Math..

[12]  John E. Mitchell,et al.  Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement , 2007, Discret. Optim..

[13]  Gilbert Laporte,et al.  The Rainbow Cycle Cover Problem , 2016, Networks.

[14]  Hikoe Enomoto,et al.  Partition of a graph into cycles and degenerated cycles , 2004, Discret. Math..

[15]  Jorge Moreno,et al.  A note on the rainbow cycle cover problem , 2019, Networks.

[16]  Alan M. Frieze,et al.  Multicoloured Hamilton Cycles , 1995, Electron. J. Comb..

[17]  Raffaele Cerulli,et al.  On the complexity of rainbow spanning forest problem , 2018, Optim. Lett..

[18]  Xueliang Li,et al.  The complexity for partitioning graphs by monochromatic trees, cycles and paths , 2004, Int. J. Comput. Math..