A hybrid algorithm for the robust graph coloring problem

A hybrid algorithm for the robust graph coloring problem

AbstractA 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.

Saved in:
Bibliographic Details
Main Authors: Mora-Gutiérrez,Roman Anselmo, Ramírez-Rodríguez,Javier, Rincón-García,Eric A., Ponsich,Antonin, Laureano-Cruces,Ana Lilia
Format: Digital revista
Language:English
Published: Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica. 2016
Online Access:http://www.scielo.sa.cr/scielo.php?script=sci_arttext&pid=S1409-24332016000200421
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.scielo.sa.cr/scielo.php?script=sci_arttext&pid=S1409-24332016000200421

Similar Items