<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332016000200421</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A hybrid algorithm for the robust graph coloring problem]]></article-title>
<article-title xml:lang="es"><![CDATA[Un algoritmo híbrido para el problema de coloración robusta de gráficas]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[Roman Anselmo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[Javier]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[Eric A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[Antonin]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Laureano-Cruces]]></surname>
<given-names><![CDATA[Ana Lilia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma Metropolitana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma Metropolitana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Autónoma Metropolitana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Autónoma Metropolitana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Autónoma Metropolitana  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>MX</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<volume>23</volume>
<numero>2</numero>
<fpage>421</fpage>
<lpage>444</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332016000200421&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332016000200421&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332016000200421&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[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.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[ResumenEn este artículo se propone un algoritmo híbrido que combina técnicas de programación matemática (algoritmo de Kruskal y la estrategia de mantener consistencia de arcos para resolver el problema de satisfacción de restricciones) y métodos heurísticos (método de composición musical y DSATUR) para resolver el problema de coloración robusta de gráficas (RGCP). Resultados experimentales muestran que este algorimo da mejores resultados que otros presentados en la literatura.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[combinatorial optimization]]></kwd>
<kwd lng="en"><![CDATA[integer programming]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[optimización combinatoria]]></kwd>
<kwd lng="es"><![CDATA[programación entera]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A branch-and-price algorithm for the robust graph coloring problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Archetti]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Bianchessi]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2014</year>
<volume>165</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>49-59</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berge]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graphes et Hypergraphes]]></source>
<year>1973</year>
<publisher-loc><![CDATA[Paris ]]></publisher-loc>
<publisher-name><![CDATA[Dunod]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Birattari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Tuning Metaheuristics: A Machine Learning Perspective]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Constraint satisfaction problems: Algorithms and applications]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brailsford]]></surname>
<given-names><![CDATA[S.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Potts]]></surname>
<given-names><![CDATA[C.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[B.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1999</year>
<volume>119</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>557-81</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[New methods to color the vertices of a graph]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brélaz]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Communications of the ACM]]></source>
<year>1979</year>
<volume>22</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>251-6</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Automated university timetabling the state of the art]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Jackson]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kingston]]></surname>
<given-names><![CDATA[J H.]]></given-names>
</name>
<name>
<surname><![CDATA[Weare]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Computer Journal]]></source>
<year>1997</year>
<volume>40</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>565-71</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Some experiments with simulated annealing for coloring graphs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chams]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hertz]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[de Werra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1987</year>
<volume>32</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>260-6</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Greedy randomized adaptive search procedures]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Feo]]></surname>
<given-names><![CDATA[T.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[J. of Global Optimization]]></source>
<year>1995</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>109-33</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Future paths for integer programming and links to artificial intelligence]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and Operations Research]]></source>
<year>1986</year>
<volume>13</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>533-49</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<article-title xml:lang=""><![CDATA[Scatter search]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Laguna]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Evolutionary Computing]]></source>
<year>2003</year>
<page-range>519-37</page-range><publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ying]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new neighborhood based on improvement graph for robust graph coloring problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Webb]]></surname>
<given-names><![CDATA[G.I.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<source><![CDATA[AI 2004: Advances in Artificial Intelligence]]></source>
<year>2004</year>
<page-range>636-45</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Heuristics for the robust coloring problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[López-Bracho]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista de Matemática: Teoría y Aplicaciones]]></source>
<year>2010</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>137-47</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A graph coloring approach for image segmentation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Montero]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yáñez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Poidomani]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Omega]]></source>
<year>2007</year>
<volume>35</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>173-83</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new hybrid genetic algorithm for the robust graph coloring problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Gedeon]]></surname>
<given-names><![CDATA[T.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Fung]]></surname>
<given-names><![CDATA[L.C.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Lecture Notes in Artificial Intelligence]]></source>
<year>2003</year>
<volume>2903</volume>
<page-range>125-36</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[On the shortest spanning subtree of a graph and the traveling salesman problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kruskal]]></surname>
<given-names><![CDATA[J.B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of the American Mathematical Society]]></source>
<year>1956</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>48-50</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Algorithms for constraint-satisfaction problems: A survey]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[AI magazine]]></source>
<year>1992</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>32-44</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Un algoritmo evolutivo para resolver el problema de coloración robusta]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[López-Bracho]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista de Matemática: Teoría y Aplicaciones]]></source>
<year>2005</year>
<volume>12</volume>
<numero>1-2</numero>
<issue>1-2</issue>
<page-range>111-20</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laureano-Cruces]]></surname>
<given-names><![CDATA[A.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-González]]></surname>
<given-names><![CDATA[D.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Méndez-Gurrola]]></surname>
<given-names><![CDATA[I.I]]></given-names>
</name>
</person-group>
<source><![CDATA[An ant colony algorithm for the robust graph coloring problem]]></source>
<year>2011</year>
<conf-name><![CDATA[ ICGST AIML-11 Conference]]></conf-name>
<conf-loc>Dubai </conf-loc>
<page-range>57-60</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Scheduling for stability in single-machine production systems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leus]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Herroelen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Scheduling]]></source>
<year>2007</year>
<volume>10</volume>
<page-range>223-35</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for robust graph coloring problem]]></source>
<year>2004</year>
<conf-name><![CDATA[ 16IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>514-8</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Robust graph coloring for uncertain supply chain management]]></source>
<year>2005</year>
<conf-name><![CDATA[ 38thHawaii International Conference on System Sciences]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-10</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithms for Constraint Satisfaction Problems (CSPs)]]></source>
<year>1998</year>
<publisher-loc><![CDATA[Canada ]]></publisher-loc>
<publisher-name><![CDATA[University of Waterloo]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Maniezzo]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[St´'utzle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Vo&#946;]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matheuristics. Hybridizing Metaheuristics and Mathematical Programming]]></source>
<year>2009</year>
<volume>10</volume>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Scatter search: Diseño básico y estrategias avanzadas]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martí]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Laguna]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2003</year>
<volume>7</volume>
<numero>19</numero>
<issue>19</issue>
<page-range>123-30</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An optimization algorithm inspired by musical composition]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>2012</year>
<page-range>1-15</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An optimization algorithm inspired by social creativity systems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computing]]></source>
<year>2012</year>
<volume>94</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>887-914</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Diseño y Desarrollo de un Método Heurístico Basado en un Sistema Socio-Cultural de Creatividad para la Resolución de Problemas de Optimización Continuos no Lineales y Diseño de Zonas Electorales]]></source>
<year>2013</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An optimization algorithm inspired by musical composition in constrained optimization problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera-Alcántara]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista de Matemática: Teoría y Aplicaciones]]></source>
<year>2013</year>
<volume>20</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>183-202</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Adaptation of the musical composition method for solving constrained optimization problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera-Alcántara]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing]]></source>
<year>2013</year>
<volume>18</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1931-48</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mavridou]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Xue]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The graph coloring problem: A bibliographic survey]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[D.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Combinatorial Optimization]]></source>
<year>1998</year>
<volume>2</volume>
<page-range>331-95</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Kluwer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ramírez-Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Extensiones del Problema de Coloración de Grafos]]></source>
<year>2001</year>
<publisher-loc><![CDATA[Madrid, España ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Complutense]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A filtering algorithm for constraints of difference in CSPs]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Régin]]></surname>
<given-names><![CDATA[J.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of AAAI]]></source>
<year>1994</year>
<volume>1</volume>
<page-range>362-7</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The robust coloring problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yáñez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2003</year>
<volume>148</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>546-58</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Metaheuristics for robust graph coloring]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2013</year>
<volume>19</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>529-48</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Extensions of coloring models for scheduling purposes]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[de Werra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operations Research]]></source>
<year>1996</year>
<volume>92</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>474-92</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de Werra]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Some combinatorial models for course scheduling]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ross]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practice and Theory of Automated Timetabling]]></source>
<year>1996</year>
<page-range>296-308</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
