Heuristics for the robust coloring problem
Guardado en:
| Autores: | , , , |
|---|---|
| Formato: | artículo original |
| Estado: | Versión publicada |
| Fecha de Publicación: | 2011 |
| Descripción: | 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 k-coloring. 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. |
| País: | Portal de Revistas UCR |
| Institución: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Lenguaje: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2119 |
| Acceso en línea: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2119 |
| Palabra clave: | graph coloring robust coloring heuristics coloración de grafos coloración robusta heurísticas |