<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992019000400081</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Heurísticas de Construccción Voraces para el Problema de Máxima Cobertura Dinámico.]]></article-title>
<article-title xml:lang="en"><![CDATA[Heuristic Constructive Greedy for Dynamic Maximal Covering Location Problem.]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosabal Alfonso]]></surname>
<given-names><![CDATA[Yadira]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Porras Nodarse]]></surname>
<given-names><![CDATA[Cynthia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fajardo Calderín]]></surname>
<given-names><![CDATA[Jenny]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría  ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Deusto  ]]></institution>
<addr-line><![CDATA[ Bilbao]]></addr-line>
<country>Spain</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<volume>13</volume>
<numero>4</numero>
<fpage>81</fpage>
<lpage>97</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992019000400081&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992019000400081&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992019000400081&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Los problemas de localización de instalaciones se aplican a una gama amplia de situaciones reales ganando un gran interés en el ámbito de la investigación. El problema de localización de máxima cobertura (MCLP) es uno de los modelos clásicos de la literatura y su objetivo es maximizar la cobertura sobre la demanda de una población con recursos limitados. De este problema se conoce la variante dinámica (DMCLP) que a diferencia del clásico maximiza la cobertura en múltiples períodos. Los métodos aproximados han sido muy utilizados en la resolución del MCLP y sus variantes. Las heurísticas constructivas, clasificadas dentro del grupo de las heurísticas, son muy conocidas por la rapidez en encontrar soluciones de buena calidad de los problemas de localización, utilizadas en ocasiones como solución inicial en los algoritmos metaheurísticos y obteniendo buenos resultados. Para dar solución al DMCLP se proponen en este trabajo cuatro heurísticas constructivas voraces. Se realiza un primer experimento para conocer la heurística más adecuada para el DMCLP. Finalmente, se comparan las mejores heurísticas con el algoritmo metaheurístico Escalador de Colinas empleado en la literatura para resolver el DMCLP.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The problems of localization of facilities are applied to a wide range of real situations winning a great interest in the environment of the investigation. The maximal covering location problem (MCLP) it is one of the classic models of the literature and their objective is to maximize the population's covering with limited resources. Of this problem the dynamic variant is known (DMCLP) that maximizes the covering in multiple periods contrary to the classic. The approximate methods have been very used in the resolution of the localization problems and their variants. The heuristic constructive classified inside the group of the heuristic ones they are very well-known for the speed and quality in finding solutions to the localization problems, used in occasions as initial solution in the algorithms metaheuristics, obtaining good results this combination. To give solution to the dynamic pattern they intend in this work four heuristic constructive greedy. they are carried out a first experiment to know which of the heuristic ones outlined it is the most appropriate in the proposed pattern. Finally, it is compared the best heuristic with the algorithm metaheuristics Hill Climbing used in the literature to solve the DMCLP.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Palabras claves: Algoritmos Metaheurísticos]]></kwd>
<kwd lng="es"><![CDATA[Heurísticas Constructivas]]></kwd>
<kwd lng="es"><![CDATA[Algoritmos Voraces]]></kwd>
<kwd lng="es"><![CDATA[Problema Máxima Cobertura Dinámico]]></kwd>
<kwd lng="en"><![CDATA[Algorithms Metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[Heuristics Constructive]]></kwd>
<kwd lng="en"><![CDATA[Algorithms Greedy]]></kwd>
<kwd lng="en"><![CDATA[Dynamic Maximal Covering Location Problem]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zarandi]]></surname>
<given-names><![CDATA[M. H. F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The large-scale dynamic maximal covering location problem]]></article-title>
<source><![CDATA[Mathematical Computer Modelling]]></source>
<year>2013</year>
<volume>57</volume>
<numero>3-4</numero>
<issue>3-4</issue>
<page-range>710-9</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[ReVelle]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The maximal covering location problem]]></article-title>
<source><![CDATA[Papers of the Regional Science Association]]></source>
<year>1974</year>
<volume>32</volume>
<numero>21</numero>
<issue>21</issue>
<page-range>101-18</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[A. T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Maximal Coverage Location Problem: Impacts, Significance, and Evolution]]></article-title>
<source><![CDATA[Internacional Regional Science Review]]></source>
<year>2016</year>
<volume>39</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>5-27</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Curtin]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models]]></article-title>
<source><![CDATA[Netw Spat Econ]]></source>
<year>2010</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>125-45</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guarín]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Fast reaction police units in Medellín: A budget-constrained maximal homicide covering location approach]]></source>
<year>2015</year>
<publisher-loc><![CDATA[Colombia ]]></publisher-loc>
<publisher-name><![CDATA[Banco de la República]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chawathe]]></surname>
<given-names><![CDATA[S. S]]></given-names>
</name>
</person-group>
<source><![CDATA[Organizing Hot-Spot Police Patrol Routes]]></source>
<year>2007</year>
<page-range>79-86</page-range><publisher-name><![CDATA[Intelligence and Security Informatics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tutschku]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Demand-based Radio Network Planing of Cellular Mobile Communication System]]></source>
<year>1998</year>
<page-range>1054-61</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Erdemir]]></surname>
<given-names><![CDATA[E. T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Location coverage models with demand originating from nodes and paths: application to cellular network design]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2008</year>
<volume>190</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>610-32</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Farahani]]></surname>
<given-names><![CDATA[R. Z]]></given-names>
</name>
</person-group>
<source><![CDATA[Covering problems in facility location: A review]]></source>
<year>2012</year>
<volume>62</volume>
<page-range>368-407</page-range><publisher-name><![CDATA[Computers &amp; Industrial Engineering]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[A. T]]></given-names>
</name>
</person-group>
<source><![CDATA[Continuous space maximal coverage: insights, advances and challenges]]></source>
<year>2015</year>
<volume>62</volume>
<page-range>325-36</page-range><publisher-name><![CDATA[Computers &amp; Operations Research]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rezazadeh]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robust cooperative maximal covering location problem: a case study of the locating Tele-Taxi stations in Tabriz, Iran]]></article-title>
<source><![CDATA[International Journal of Services and Operations Management]]></source>
<year>2018</year>
<volume>29</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>163-83</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martí]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Procedimientos Metaheurísticos en Optimización Combinatoria]]></source>
<year>2006</year>
<volume>60</volume>
<page-range>3-62</page-range><publisher-name><![CDATA[Matemátiques]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[A. T]]></given-names>
</name>
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[R. L]]></given-names>
</name>
</person-group>
<source><![CDATA[Applying Simulated Annealing to Location-planning Models]]></source>
<year>1996</year>
<volume>2</volume>
<page-range>31-53</page-range><publisher-name><![CDATA[Journal of Heuristics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adenso-Díaz]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Simple Search Heuristic for the MCLP: Application to the Location of Ambulance Bases in a Rural Region]]></article-title>
<source><![CDATA[Omega]]></source>
<year>1995</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>187</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fajardo]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing en Problemas de Optimización Dinámicos]]></source>
<year>2015</year>
<publisher-loc><![CDATA[España ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Granada]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stutzle]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Iterated Greedy]]></source>
<year>2018</year>
<page-range>36</page-range><publisher-loc><![CDATA[Belgium ]]></publisher-loc>
<publisher-name><![CDATA[IRIDIA-Technical Report Series]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E. G]]></given-names>
</name>
</person-group>
<source><![CDATA[Metahueristics: from design to implementation]]></source>
<year>2009</year>
<volume>74</volume>
<page-range>593</page-range><publisher-name><![CDATA[John Wiley and Sons, Inc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuehn]]></surname>
<given-names><![CDATA[A. A]]></given-names>
</name>
<name>
<surname><![CDATA[Hamburger]]></surname>
<given-names><![CDATA[M. J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic program for locating warehouses]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1963</year>
<volume>9</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>643-66</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Feldman]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehouse location under continuous economics of scale]]></article-title>
<source><![CDATA[Management Sciences]]></source>
<year>1966</year>
<volume>12</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>670-84</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Downs]]></surname>
<given-names><![CDATA[B. T]]></given-names>
</name>
<name>
<surname><![CDATA[Camm]]></surname>
<given-names><![CDATA[J. D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An exact algorithm for the maximal covering problem.]]></article-title>
<source><![CDATA[Naval Research Logistics Quarterly]]></source>
<year>1996</year>
<volume>43</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>435-61</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xia]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[An empirical comparison of five efficient heuristics for maximal covering location problems]]></source>
<year>2019</year>
<page-range>747-53</page-range><publisher-name><![CDATA[IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dzatora]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Dzatorb]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[An Efficient Modified Greedy Algorithm for the P-Median Problem.]]></source>
<year>2015</year>
<page-range>1855-61</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haghani]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Capacitated maximum covering location models: Formulations and solution procedures]]></article-title>
<source><![CDATA[Journal of Advanced Transportation]]></source>
<year>1996</year>
<volume>30</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>101-36</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hochbaum]]></surname>
<given-names><![CDATA[D. S]]></given-names>
</name>
<name>
<surname><![CDATA[Pathria]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analysis of the greedy approach in problems of maximum k-coverage]]></article-title>
<source><![CDATA[Naval Research Logistics Quarterly]]></source>
<year>1998</year>
<volume>45</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>615-27</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saldanha]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Captivo]]></surname>
<given-names><![CDATA[M. E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic approach for the discrete dynamic location problem]]></article-title>
<source><![CDATA[Location Science]]></source>
<year>1998</year>
<volume>6</volume>
<numero>1-4</numero>
<issue>1-4</issue>
<page-range>1211-23</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Indriasari]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[Integration of Travel Time Zone for Optimal Siting of Emergency Facilities]]></source>
<year>2008</year>
<publisher-loc><![CDATA[Malaysia ]]></publisher-loc>
<publisher-name><![CDATA[University Putra]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodsi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Indriasari]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[Facility Location Models Development to Maximize Total Service Area]]></source>
<year>2009</year>
<page-range>2087-100</page-range><publisher-name><![CDATA[Theoretical and Empirical Researches in Urban Management]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pratap]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Big Step Greedy Heuristic for Maximum Coverage Problem]]></article-title>
<source><![CDATA[International Journal of Computer Applications (0975 - 8887)]]></source>
<year>2015</year>
<volume>125</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>19-24</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bulut]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Szymanski]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<source><![CDATA[Rethinking Offloading WiFi Access Point Deployment from User Perspective]]></source>
<year>2016</year>
<page-range>59-65</page-range><publisher-name><![CDATA[Workshop on Smart Environments &amp; Urban Networking]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schilling]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic Location Modeling for Public-Sector Facilities: A Multicriteria Approach]]></article-title>
<source><![CDATA[D. S]]></source>
<year>1980</year>
<volume>11</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>714-24</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gunawardane]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic versions of set covering type public facility location problems]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1982</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>190-5</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Marti]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Reinel]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[The Linear Ordering Problem Exact and Heuristics Method in Combinatorial Optimization]]></source>
<year>2011</year>
<volume>12</volume>
<page-range>172</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<source><![CDATA[Future paths for integer programming and links to arti&#64257;cial intelligence]]></source>
<year>1986</year>
<volume>13</volume>
<page-range>533-49</page-range><publisher-name><![CDATA[Computers &amp; Operations Research]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Friedman]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The use of ranks to avoid the assumption of normality implicit in the analysis of variance]]></article-title>
<source><![CDATA[Journal of the American Statistical Association]]></source>
<year>1937</year>
<volume>32</volume>
<numero>200</numero>
<issue>200</issue>
<page-range>675-701</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Holm]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A simple sequentially rejective multiple test procedure]]></source>
<year>1979</year>
<volume>6</volume>
<page-range>65-70</page-range><publisher-name><![CDATA[Scandinavian Journal of Statistics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Finner]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[On a monotonicity problem in step-down multiple test procedures]]></source>
<year>1993</year>
<volume>88</volume>
<page-range>920-3</page-range><publisher-name><![CDATA[Journal of the American Statistical Association]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A two-step rejection procedure for testing multiple hypotheses]]></source>
<year>2008</year>
<volume>138</volume>
<page-range>1521-7</page-range><publisher-name><![CDATA[Journal of Statistical Planning and Inference]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A study on the use of nonparametric tests for analyzing the evolutionary algorithms behaviour: a case study on the cec2005 special session on real parameter optimization]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2009</year>
<volume>16</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>617</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reinelt]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[TSPLIB.A traveling salesman problem library]]></article-title>
<source><![CDATA[ORSA Journal on Computing]]></source>
<year>1991</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>376-84</page-range></nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bagherinejad]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Developing dynamic maximal covering location problem considering capacitated facilities and solving it using hill climbing and genetic algorithm]]></article-title>
<source><![CDATA[Engineering Review]]></source>
<year>2017</year>
<volume>37</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>178-93</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
