Artículos de revistas
A DSATUR-based algorithm for the Equitable Coloring Problem
Fecha
2015-02Registro en:
Méndez-Díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A DSATUR-based algorithm for the Equitable Coloring Problem; Pergamon-Elsevier Science Ltd; Computers & Operations Research; 57; 2-2015; 41-50
0305-0548
CONICET Digital
CONICET
Autor
Méndez-Díaz, Isabel
Nasini, Graciela Leonor
Severin, Daniel Esteban
Resumen
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances.