Branch-and-cut algorithms for colorful components problems

Claudia Archetti, Martina Cerulli, Carmine Sorgente

We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined…