A hybrid algorithm for the robust graph coloring problem
Đã lưu trong:
| Nhiều tác giả: | , , , , |
|---|---|
| Định dạng: | artículo original |
| Trạng thái: | Versión publicada |
| Ngày xuất bản: | 2016 |
| Miêu tả: | 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. |
| Quốc gia: | Portal de Revistas UCR |
| Tổ chức giáo dục: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Ngôn ngữ: | Inglés |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/25269 |
| Truy cập trực tuyến: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/25269 |
| Từ khóa: | metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera |