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.
E. Malaguti, I. Mendez-Dıaz, J. J. Miranda-Bront, P. Zabala (2013). (k, c) − coloring via Column Generation. ELECTRONIC NOTES IN DISCRETE MATHEMATICS, 41, 447-454 [10.1016/j.endm.2013.05.124].
(k, c) − coloring via Column Generation
MALAGUTI, ENRICO;
2013
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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
