<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">463202775</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405153116.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170326e20070801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10732-007-9010-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10732-007-9010-x</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">New heuristics for the maximum diversity problem</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Geiza Silva, Marcos de Andrade, Luiz Ochi, Simone Martins, Alexandre Plastino]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The maximum diversity problem (MDP) consists of identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics among the elements of the subset. The identification of such solution is an NP-hard problem. Some heuristics are available to obtain approximate solutions for this problem. In this paper, we propose different GRASP heuristics for the MDP, using distinct construction procedures and including a path-relinking technique. Performance comparison among related work and the proposed heuristics is provided. Experimental results show that the new GRASP heuristics are quite robust and are able to find high-quality solutions in reasonable computational times.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2007</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Maximum diversity problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">GRASP</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Path relinking</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Metaheuristics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Silva</subfield>
   <subfield code="D">Geiza</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">de Andrade</subfield>
   <subfield code="D">Marcos</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ochi</subfield>
   <subfield code="D">Luiz</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Martins</subfield>
   <subfield code="D">Simone</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Plastino</subfield>
   <subfield code="D">Alexandre</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Heuristics</subfield>
   <subfield code="d">Kluwer Academic Publishers-Plenum Publishers; http://www.springer-ny.com</subfield>
   <subfield code="g">13/4(2007-08-01), 315-336</subfield>
   <subfield code="x">1381-1231</subfield>
   <subfield code="q">13:4&lt;315</subfield>
   <subfield code="1">2007</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">10732</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10732-007-9010-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10732-007-9010-x</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Silva</subfield>
   <subfield code="D">Geiza</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">de Andrade</subfield>
   <subfield code="D">Marcos</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ochi</subfield>
   <subfield code="D">Luiz</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Martins</subfield>
   <subfield code="D">Simone</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Plastino</subfield>
   <subfield code="D">Alexandre</subfield>
   <subfield code="u">Departamento de Ciência da Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156, Bloco E, 3° andar, Boa Viagem, 24210-240, Niterói, RJ, Brazil</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Heuristics</subfield>
   <subfield code="d">Kluwer Academic Publishers-Plenum Publishers; http://www.springer-ny.com</subfield>
   <subfield code="g">13/4(2007-08-01), 315-336</subfield>
   <subfield code="x">1381-1231</subfield>
   <subfield code="q">13:4&lt;315</subfield>
   <subfield code="1">2007</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">10732</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
