A tabu search approach for the sum coloring problem

The sum coloring problem has many applications in scheduling. It is a variant of the vertex coloring problem where the objective is to minimize the sum of colors used in coloring the vertices. In this paper, we use tabu search to solve the sum coloring problem. Experiments are performed on instances...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in discrete mathematics Vol. 36; pp. 915 - 922
Main Authors:	Bouziri, Hend, Jouini, Mouna
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01-08-2010
Subjects:	chromatic sum strength sum coloring problem tabu search sum coloring problem tabu search strength chromatic sum
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The sum coloring problem has many applications in scheduling. It is a variant of the vertex coloring problem where the objective is to minimize the sum of colors used in coloring the vertices. In this paper, we use tabu search to solve the sum coloring problem. Experiments are performed on instances extracted from the second DIMACS challenge. Results show significative improvements on some chromatic sum bounds.
ISSN:	1571-0653 1571-0653
DOI:	10.1016/j.endm.2010.05.116