Resumo

MORA-GUTIERREZ, Roman Anselmo et al. A hybrid algorithm for the robust graph coloring problem. Rev. Mat [online]. 2016, vol.23, n.2, pp.421-444. ISSN 1409-2433.

A hybrid algorithm 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.

Palavras-chave : metaheuristics; combinatorial optimization; integer programming.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )