A hybrid algorithm for the robust graph coloring problem
Uloženo v:
| Autoři: | , , , , |
|---|---|
| Médium: | artículo original |
| Stav: | Versión publicada |
| Datum vydání: | 2016 |
| Popis: | 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. |
| Země: | Portal de Revistas UCR |
| Instituce: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Jazyk: | Inglés |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/25269 |
| On-line přístup: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269 |
| Klíčové slovo: | metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera |