Heuristics for the robust coloring problem
Kaydedildi:
| Yazarlar: | , , , |
|---|---|
| Materyal Türü: | artículo original |
| Durum: | Versión publicada |
| Yayın Tarihi: | 2011 |
| Diğer Bilgiler: | 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. |
| Ülke: | Portal de Revistas UCR |
| Kurum: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Dil: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2119 |
| Online Erişim: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2119 |
| Anahtar Kelime: | graph coloring robust coloring heuristics coloración de grafos coloración robusta heurísticas |