A hybrid algorithm for the robust graph coloring problem
Сохранить в:
| Авторы: | , , , , |
|---|---|
| Формат: | artículo original |
| Статус: | Versión publicada |
| Дата публикации: | 2016 |
| Описание: | A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP”) and heuristic methods (musical composition method and DSATUR) to resolve the robust graph coloring problem (RGCP) is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature. |
| Страна: | Portal de Revistas UCR |
| Институт: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Язык: | Inglés |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/25269 |
| Online-ссылка: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269 |
| Ключевое слово: | metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera |