A hybrid algorithm for the robust graph coloring problem

Guardado en:

书目详细资料
Autores:	Mora-Gutiérrez, Román Anselmo, Ramírez-Rodríguez, Javier, Rincón-García, Eric A., Ponsich, Antonin, Laureano-Cruces, Ana Lilia
格式:	artículo original
状态:	Versión publicada
Fecha de Publicación:	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.
País:	Portal de Revistas UCR
机构:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
语言:	Inglés
OAI Identifier:	oai:portal.ucr.ac.cr:article/25269
在线阅读:	https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269
Palabra clave:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera