A matheuristic approach for the $b$-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

Rafael A. Melo, Michell F. Queiroz, Marcio C. Santos

Given a graph $G=(V,E)$, the $b$-coloring problem consists in attributing a color to every vertex in $V$ such that adjacent vertices receive different colors, every color has a $b$…