A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM
Fuente:
Redalyc
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artículo científico |
| Lenguaje: | en |
| Publicado: |
Universidad de Costa Rica
2016
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1876451397117935616 |
|---|---|
| author | ROMAN ANSELMO MORA-GUTIÉRREZ |
| author_facet | ROMAN ANSELMO MORA-GUTIÉRREZ |
| contents | A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM ROMAN ANSELMO MORA-GUTIÉRREZ JAVIER RAMÍREZ-RODRÍGUEZ ERIC A. RINCÓN-GARCÍA ANTONIN PONSICH ANA LILIA LAUREANO-CRUCES Física, Astronomía y Matemáticas Metaheuristics integer programming combinatorial optimization A hybrid algorithm which combines mathematical programmin g tech- niques (Kruskal’s algorithm and the strategy of maintainin g arc consis- tency to solve constraint satisfaction problem “CSP”) and h euristic meth- ods (musical composition method and DSATUR) to resolve the r obust graph coloring problem (RGCP) is proposed in this paper. Exp erimental result shows that this algorithm is better than the other alg orithms pre- sented on the literature. 2016 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45349329006 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.2 Vol.23 |
| format | Artículo científico |
| id | redalyc_45349329006 |
| institution | Redalyc |
| language | en |
| publishDate | 2016 |
| publisher | Universidad de Costa Rica |
| spellingShingle | A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM ROMAN ANSELMO MORA-GUTIÉRREZ Física, Astronomía y Matemáticas Metaheuristics integer programming combinatorial optimization A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM ROMAN ANSELMO MORA-GUTIÉRREZ JAVIER RAMÍREZ-RODRÍGUEZ ERIC A. RINCÓN-GARCÍA ANTONIN PONSICH ANA LILIA LAUREANO-CRUCES Física, Astronomía y Matemáticas Metaheuristics integer programming combinatorial optimization A hybrid algorithm which combines mathematical programmin g tech- niques (Kruskal’s algorithm and the strategy of maintainin g arc consis- tency to solve constraint satisfaction problem “CSP”) and h euristic meth- ods (musical composition method and DSATUR) to resolve the r obust graph coloring problem (RGCP) is proposed in this paper. Exp erimental result shows that this algorithm is better than the other alg orithms pre- sented on the literature. 2016 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45349329006 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.2 Vol.23 |
| title | A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM |
| topic | Física, Astronomía y Matemáticas Metaheuristics integer programming combinatorial optimization |
| url | https://www.redalyc.org/articulo.oa?id=45349329006 |