<?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-18T20:35:11Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/11496" metadataPrefix="marc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/11496</identifier><datestamp>2026-04-09T08:05:45Z</datestamp><setSpec>com_10259_5645</setSpec><setSpec>com_10259_5086</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_9820</setSpec><setSpec>col_10259_5684</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">Solana Ezquerra, Mario</subfield>
<subfield code="e">author</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">Casado Yusta, Silvia</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2026-03-21</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a">The dataset is a set of txt files with the fictitious instaces used in the paper "Iterative Stepped Search algorithm for the clique partitioning problem"&#xd;
&#xd;
The dataset is a text file containing the solutions obtained in the article “Iterative Stepped Search Algorithm for the Clique Partitioning Problem” for a set of instances from the DIMACS library.</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">https://hdl.handle.net/10259/11496</subfield>
</datafield>
<datafield tag="024" ind2=" " ind1="8">
<subfield code="a">10.71486/jdhk-b539</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Graph problems</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Cliques problems</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Heuristic optimization</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Iterated local search</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="653">
<subfield code="a">Tabu search</subfield>
</datafield>
<datafield tag="245" ind1="0" ind2="0">
<subfield code="a">Iterative Stepped Search algorithm for the clique partitioning problem</subfield>
</datafield>
</record></metadata></record></GetRecord></OAI-PMH>