A hybrid algorithm for the robust graph coloring problem

Spremljeno u:

Bibliografski detalji
Autori:	Mora-Gutiérrez, Román Anselmo, Ramírez-Rodríguez, Javier, Rincón-García, Eric A., Ponsich, Antonin, Laureano-Cruces, Ana Lilia
Format:	artículo original
Status:	Versión publicada
Datum izdanja:	2016
Opis:	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.
Zemlja:	Portal de Revistas UCR
Institucija:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
Jezik:	Inglés
OAI Identifier:	oai:portal.ucr.ac.cr:article/25269
Online pristup:	https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269
Ključna riječ:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera