Optimization, Operations Research, Python, Data Science, Editors Pick.
starts from an initial solution with k colors and possibly edges connecting nodes of the same color. Then, local moves changing the color of a given node are performed in a sense that minimizes violations, using a Tabu List to escape local optima. More efficient exact methods for the Graph Coloring