SciELO - Scientific Electronic Library Online

vol.18 issue1Heuristic for solving the multiple alignment sequence problemMinimal reducts with GRASP author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433


GUTIERREZ-ANDRADE, Miguel Ángel; LARA-VELAZQUEZ, Pedro; LOPEZ-BRACHO, Rafael  and  RAMIREZ-RODRIGUEZ, Javier. Heuristics for the robust coloring problem. Rev. Mat [online]. 2011, vol.18, n.1, pp.137-139. ISSN 1409-2433.

Let G and Ḡ be complementary graphs. Given a penalty function defined on the edges of Ḡ, we will say that the rigidity of a k-coloring of G is the sum of the penalties of the edges of Ḡ joining vertices of the same color. Based on the previous definition, the  Robust Coloring Problem (RCP) is stated as the search of the minimum rigidity  kcoloring. In this work a comparison of heuristics based on simulated annealing,  GRASP and scatter search is presented. These are the best results for the RCP that have been obtained.

Keywords : graph coloring; robust coloring; heuristics.

        · abstract in Spanish     · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License