<?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-18992022000100128</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Estudio experimental con varios enfoques de asignación de demanda en el problema de localización de máxima cobertura capacitado]]></article-title>
<article-title xml:lang="en"><![CDATA[An experimental study with several demand allocation approaches for the capacitated maximal covering location problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Suárez]]></surname>
<given-names><![CDATA[Luis]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Porras]]></surname>
<given-names><![CDATA[Cynthia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana &#8221;José Antonio Echeverría&#8221;  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<volume>16</volume>
<numero>1</numero>
<fpage>128</fpage>
<lpage>143</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992022000100128&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992022000100128&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992022000100128&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN El problema de localización de máxima cobertura ha sido ampliamente aplicado en contextos donde es necesaria la ubicación de instalaciones que brindan un servicio determinado. Este problema busca ubicar un número limitado de instalaciones con el objetivo de maximizar la cobertura sobre un conjunto de nodos de demanda. Usualmente las instalaciones son modeladas con capacidad ilimitada, pero este enfoque no es realista ya que en muchas situaciones estas poseen una carga de trabajo limitada. La limitación en la capacidad implica que es necesario determinar la mejor asignación de los nodos de demanda a las instalaciones. Este trabajo presenta seis criterios de asignación de demanda para el problema de localización de máxima cobertura capacitado. Se realiza un análisis experimental donde se resuelven varias instancias del problema, donde los resultados indican que la asignación en orden descendente de las demandas a la instalación más cercana con capacidad para cubrirla obtiene los mejores resultados.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT The maximal coverage location problem has been widely used in contexts where it is necessary to locate facilities to provide a service. This problem seeks to locate a limited number of facilities to maximize the covered demand. Commonly facilities are modeled with unlimited capacity, but this is not realistic, and in many situations, facilities have workload limits. A limited capacity means that it is also necessary to find the best allocation of customers to the facilities. This paper presents six demand node allocation procedures for the capacitated maximal coverage location problem. Performed experiments show that the the best results are obtained by asigning nodes in descending order of demands to the closest facility with available capaciy.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Asignación de demanda]]></kwd>
<kwd lng="es"><![CDATA[capacidad]]></kwd>
<kwd lng="es"><![CDATA[localización]]></kwd>
<kwd lng="es"><![CDATA[cobertura.]]></kwd>
<kwd lng="en"><![CDATA[Demand allocation]]></kwd>
<kwd lng="en"><![CDATA[Capacitated]]></kwd>
<kwd lng="en"><![CDATA[Location]]></kwd>
<kwd lng="en"><![CDATA[Coverage.]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sajjad]]></surname>
<given-names><![CDATA[Allahi]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammadsadegh]]></surname>
<given-names><![CDATA[Mobin]]></given-names>
</name>
<name>
<surname><![CDATA[Amin]]></surname>
<given-names><![CDATA[Vafadarnikjoo]]></given-names>
</name>
<name>
<surname><![CDATA[Christian]]></surname>
<given-names><![CDATA[Salmon]]></given-names>
</name>
</person-group>
<source><![CDATA[An integrated ahp- gis-mclp method to locate bank branches]]></source>
<year>2015</year>
<page-range>1104-13</page-range><publisher-loc><![CDATA[Norcross, Georgia ]]></publisher-loc>
<publisher-name><![CDATA[Proceedings of the 2015 Industrial and Systems Engineering Research Conference]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arostegui Jr]]></surname>
<given-names><![CDATA[Marvin A]]></given-names>
</name>
<name>
<surname><![CDATA[Kadipasaoglu]]></surname>
<given-names><![CDATA[Sukran N]]></given-names>
</name>
<name>
<surname><![CDATA[Khumawala]]></surname>
<given-names><![CDATA[Basheer M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems.]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2006</year>
<volume>103</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>742-54</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bagherinejad]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Shoeib]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic capacitated maximal covering location problem by considering dynamic capacity]]></article-title>
<source><![CDATA[International Journal of Industrial Engineering Computations]]></source>
<year>2018</year>
<volume>9</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>249-64</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balakrishnan]]></surname>
<given-names><![CDATA[P V]]></given-names>
</name>
<name>
<surname><![CDATA[Storbeck]]></surname>
<given-names><![CDATA[J E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mcthresh: Modeling maximum coverage with threshold constraints]]></article-title>
<source><![CDATA[Environment and Planning B: Planning and Design]]></source>
<year>1991</year>
<volume>18</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>459-72</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chung]]></surname>
<given-names><![CDATA[CH]]></given-names>
</name>
<name>
<surname><![CDATA[Schilling]]></surname>
<given-names><![CDATA[DA]]></given-names>
</name>
<name>
<surname><![CDATA[Carbone]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[The capacitated maximal covering problem: A heuristic]]></source>
<year>1983</year>
<page-range>1423-8</page-range><publisher-name><![CDATA[Proceedings of Fourteenth Annual Pittsburgh Conference on Modeling and Simulation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
<name>
<surname><![CDATA[ReVelle]]></surname>
<given-names><![CDATA[Charles]]></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>1</numero>
<issue>1</issue>
<page-range>101-18</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[Richard L]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[Alan]]></given-names>
</name>
</person-group>
<source><![CDATA[Location Covering Models: History, Applications and Advancements]]></source>
<year>2018</year>
<publisher-name><![CDATA[Advances in Spatial Science. Springer International Publishing AG]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cook]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[The traveling salesman problem (tsp). Technical report, Department of Combinatorics and Optimi- zation]]></source>
<year>2019</year>
<publisher-name><![CDATA[University of Waterloo]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davari]]></surname>
<given-names><![CDATA[Soheil]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammad]]></surname>
<given-names><![CDATA[Hossein]]></given-names>
</name>
<name>
<surname><![CDATA[Zarandi]]></surname>
<given-names><![CDATA[Fazel]]></given-names>
</name>
<name>
<surname><![CDATA[Turksen]]></surname>
<given-names><![CDATA[I Burhan]]></given-names>
</name>
</person-group>
<source><![CDATA[A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii]]></source>
<year>2013</year>
<volume>41</volume>
<page-range>68-76</page-range><publisher-name><![CDATA[Knowledge-Based Systems,]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[Joaquín]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[Salvador]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[Daniel]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
</person-group>
<source><![CDATA[A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms.]]></source>
<year>2011</year>
<volume>1</volume>
<page-range>3-18</page-range><publisher-name><![CDATA[Swarn and Evolutionary Computation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fajardo]]></surname>
<given-names><![CDATA[Jenny]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing en Problemas de Optimización Dinámicos]]></source>
<year>2015</year>
<publisher-name><![CDATA[Granada University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fajardo]]></surname>
<given-names><![CDATA[Jenny]]></given-names>
</name>
<name>
<surname><![CDATA[Porras]]></surname>
<given-names><![CDATA[Cynthia]]></given-names>
</name>
<name>
<surname><![CDATA[Sanchez]]></surname>
<given-names><![CDATA[Leydis]]></given-names>
</name>
<name>
<surname><![CDATA[Estrada]]></surname>
<given-names><![CDATA[Diago E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Software tool for model and solve the maximum coverage location problem, a case study: Locations police officers]]></article-title>
<source><![CDATA[Revista de Investigación Operacional (RIO)]]></source>
<year>2017</year>
<volume>38</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>141-9</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hossein]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
<name>
<surname><![CDATA[Zarandi]]></surname>
<given-names><![CDATA[Fazel]]></given-names>
</name>
<name>
<surname><![CDATA[Davari]]></surname>
<given-names><![CDATA[Soheil]]></given-names>
</name>
<name>
<surname><![CDATA[Haddad Sisakht]]></surname>
<given-names><![CDATA[Seyyed Ali]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The large-scale dynamic maximal covering location problem]]></article-title>
<source><![CDATA[Mathematical and 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="B14">
<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="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ross]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[Richard L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Closest assignment constraints and location models: Proper- ties and structure.]]></article-title>
<source><![CDATA[Location Science]]></source>
<year>1996</year>
<volume>4</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>251-70</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haghani]]></surname>
<given-names><![CDATA[Ali]]></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="B17">
<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="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jabalameli]]></surname>
<given-names><![CDATA[M. S]]></given-names>
</name>
<name>
<surname><![CDATA[Bankian Tabrizi]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Moshref Javadi]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Capacitated facility location problem with variable coverage radius in distribution system.]]></article-title>
<source><![CDATA[IUST]]></source>
<year>2010</year>
<volume>21</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>231-7</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gunhak]]></surname>
<given-names><![CDATA[Lee]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[Alan T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Maximal covering with network survivability requirements in wireless mesh networks]]></article-title>
<source><![CDATA[Computers, Environment and Urban Systems,]]></source>
<year>2010</year>
<volume>34</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>49-57</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[Alan T]]></given-names>
</name>
<name>
<surname><![CDATA[Jing]]></surname>
<given-names><![CDATA[Xu]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Zifan]]></given-names>
</name>
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[Richard L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Commercial gis location analytics: capabilities and performance]]></article-title>
<source><![CDATA[International Journal of Geographical Information Science]]></source>
<year>2019</year>
<volume>33</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1106-30</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rapeepan]]></surname>
<given-names><![CDATA[Pitakaso]]></given-names>
</name>
<name>
<surname><![CDATA[Sindhuchao]]></surname>
<given-names><![CDATA[Sombat]]></given-names>
</name>
</person-group>
<source><![CDATA[The combination of max-min ant system and iterated local search heuristic for capacitated p-median problem]]></source>
<year>2021</year>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pulver]]></surname>
<given-names><![CDATA[Aaron]]></given-names>
</name>
<name>
<surname><![CDATA[Wei]]></surname>
<given-names><![CDATA[Ran]]></given-names>
</name>
<name>
<surname><![CDATA[Mann]]></surname>
<given-names><![CDATA[Clay]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Locating aed enabled medical drones to enhance cardiac arrest response times]]></article-title>
<source><![CDATA[Prehospital Emergency Care]]></source>
<year>2016</year>
<volume>20</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>378-89</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salari]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An iterated local search for the budget constrained generalized maximal covering location problem.]]></article-title>
<source><![CDATA[Journal of Mathematical Modelling and Algorithms in Operations Research]]></source>
<year>2014</year>
<volume>13</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>301-13</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Behzad]]></surname>
<given-names><![CDATA[Bankian]]></given-names>
</name>
<name>
<surname><![CDATA[Saeed Jabalameli]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Moshref Javadi]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simulated annealing method to solve a generalized maximal covering location problem.]]></article-title>
<source><![CDATA[International Journal of Industrial Engineering Computations]]></source>
<year>2011</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>439-48</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Triguero]]></surname>
<given-names><![CDATA[Isaac]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[Sergio]]></given-names>
</name>
<name>
<surname><![CDATA[Moyano]]></surname>
<given-names><![CDATA[Jose M]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[Salvador]]></given-names>
</name>
<name>
<surname><![CDATA[Alcalá-Fdez]]></surname>
<given-names><![CDATA[Jesús]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Keel 3.0: An open source software for multi-stage analysis in data mining.]]></article-title>
<source><![CDATA[International Journal of Computational Intelli- gence Systems,]]></source>
<year>2017</year>
<volume>10</volume>
<page-range>1238-49</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jing]]></surname>
<given-names><![CDATA[Xu]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[Alan]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Zifan]]></given-names>
</name>
<name>
<surname><![CDATA[Church]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Challenges in applying capacitated covering models.]]></article-title>
<source><![CDATA[Transactions]]></source>
<year>2020</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>268-90</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xue]]></surname>
<given-names><![CDATA[Yanyan]]></given-names>
</name>
<name>
<surname><![CDATA[Zongguo]]></surname>
<given-names><![CDATA[Wen]]></given-names>
</name>
<name>
<surname><![CDATA[Xiaoli]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Bressers]]></surname>
<given-names><![CDATA[Hans Th]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Chenkai]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Location optimization of urban mining facilities with maximal covering model in gis: A case of china.]]></article-title>
<source><![CDATA[Journal of Industrial Ecology]]></source>
<year>2016</year>
<volume>21</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>913-23</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
