<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-19T19:12:29Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/8477" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/8477</identifier><datestamp>2024-01-26T01:05:26Z</datestamp><setSpec>com_10259_4249</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_4250</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield tag="042" ind1=" " ind2=" ">
<subfield code="a">dc</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Pacheco Bonrostro, Joaquín</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="720" ind1=" " ind2=" ">
<subfield code="a">Valencia García, Olga</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2003-06</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">A series of metaheuristic algorithms is proposed and analyzed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. These algorithms incorporate genetic operators and local search and tabu search procedures. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithms obtain better results than previously reported methods, especially with a small number of clusters.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">0167-9473</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">http://hdl.handle.net/10259/8477</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.1016/S0167-9473(02)00224-4</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Clusterization</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Metaheuristics</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Tabu search</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Genetic algorithms</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Memetic algorithms</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Hybrid algorithms</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">Design of hybrids for the minimum sum-of-squares clustering problem</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>