Article ID Journal Published Year Pages File Type
4651810 Electronic Notes in Discrete Mathematics 2013 8 Pages PDF
Abstract

In this paper we study the (k,c) – coloring problem, a generalization of the well known Vertex Coloring Problem (VCP). We propose a new formulation and compare it computationally with another formulation from the literature. We also develop a diving heuristic that provides with good quality results at a reasonable computational effort.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics