SciELO - Scientific Electronic Library Online

vol.23 issue2A combinatorial problem on a directed graphClustering problems in a multiobjective framework author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Revista de Matemática Teoría y Aplicaciones

Print version ISSN 1409-2433


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.

Keywords : metaheuristics; combinatorial optimization; integer programming.

        · abstract in Spanish     · text in English     · English ( pdf )