A hybrid algorithm for the robust graph coloring problem

Gespeichert in:

Bibliographische Detailangaben
Autoren:	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
Publikationsdatum:	2016
Beschreibung:	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.
Land:	Portal de Revistas UCR
Institution:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
Sprache:	Inglés
OAI Identifier:	oai:portal.ucr.ac.cr:article/25269
Online Zugang:	https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269
Stichwort:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera