Autor(es)

Enrico Malaguti and Isabel Méndez-Díaz and Juan Jose Miranda-Bront and Paula Zabala

URL Pública

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.