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 |