Exact weighted vertex coloring via branch-and-price

  title={Exact weighted vertex coloring via branch-and-price},
  author={Fabio Furini and Enrico Malaguti},
  journal={Discrete Optimization},
We consider the Weighted Vertex Coloring Problem (WVCP), in which a positive weight is associated to each vertex of a graph. In WVCP, one is required to assign a color to each vertex in such a way that colors on adjacent vertices are different, and the objective is to minimize the sum of the costs of the colors used, where the cost of each color is given by the maximum weight of the vertices assigned to that color. This NP-hard problem arises in practical scheduling applications, where it is… CONTINUE READING