Code and Data Repository for Branch-and-Cut Algorithms for Colorful Components Problems
研究了将彩色图划分为连通彩色组件的三个优化问题，提出整数非线性规划模型并线性化，开发了分支切割精确算法，包含有效不等式、边界缩减、热启动和预处理技术。
We tackle three optimization problems in which a colored graph must be partitioned into connected colorful components. A component is colorful if all its vertices have different colors. We consider three different objectives, formulate the resulting problems as integer nonlinear programs and linearize them through standard linearization techniques. Then, we develop exact branch-and-cut algorithms, including families of valid inequalities for each problem, bounds reducing the size of the models, warm-start and preprocessing techniques.