A hybrid algorithm for the robust graph coloring problem

Sparad:

Bibliografiska uppgifter
Författarna:	Mora-Gutiérrez, Román Anselmo, Ramírez-Rodríguez, Javier, Rincón-García, Eric A., Ponsich, Antonin, Laureano-Cruces, Ana Lilia
Materialtyp:	artículo original
Status:	Versión publicada
Utgivningstid:	2016
Beskrivning:	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
Organisation:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
Språk:	Inglés
OAI Identifier:	oai:archivo.portal.ucr.ac.cr:article/25269
Länkar:	https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/25269
Nyckelord:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera