## A Branch-and-Price Algorithm for the Minimum Sum Coloring Problem

A proper coloring of a given graph is an assignment of colors (integer numbers) to its vertices such that two adjacent vertices receives didifferent colors. This paper studies the Minimum Sum Coloring Problem (MSCP), which asks for finding a proper coloring while minimizing the sum of the colors assigned to the vertices. This paper presents … Read more