A hybrid algorithm for the robust graph coloring problem

Tallennettuna:

Bibliografiset tiedot
Tekijät:	Mora-Gutiérrez, Román Anselmo, Ramírez-Rodríguez, Javier, Rincón-García, Eric A., Ponsich, Antonin, Laureano-Cruces, Ana Lilia
Aineistotyyppi:	artículo original
Tila:	Versión publicada
Julkaisupäivä:	2016
Kuvaus:	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.
Maa:	Portal de Revistas UCR
Organisaatio:	Universidad de Costa Rica
Repositorio:	Portal de Revistas UCR
Kieli:	Inglés
OAI Identifier:	oai:portal.ucr.ac.cr:article/25269
Linkit:	https://revistas.ucr.ac.cr/index.php/matematica/article/view/25269
Sanahaku:	metaheuristics combinatorial optimization integer programming metaheurísticas optimización combinatoria programación entera