Heuristics for the robust coloring problem
保存先:
| 著者: | , , , |
|---|---|
| フォーマット: | artículo original |
| 状態: | Versión publicada |
| 出版日付: | 2011 |
| その他の書誌記述: | 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. |
| 国: | Portal de Revistas UCR |
| 機関: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 言語: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/2119 |
| オンライン･アクセス: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/2119 |
| キーワード: | graph coloring robust coloring heuristics coloración de grafos coloración robusta heurísticas |