2026-04-20T03:38:14Zhttps://riubu.ubu.es/oai/requestoai:riubu.ubu.es:10259/98222025-05-12T08:02:12Zcom_10259_5645com_10259_5086com_10259_2604col_10259_9820col_10259_5684
Repositorio Institucional de la Universidad de Burgos
author
Pacheco Bonrostro, Joaquín
author
Casado Yusta, Silvia
2024-12-20T12:19:21Z
2024-12-20T12:19:21Z
2022
http://hdl.handle.net/10259/9822
10.71486/5n2k-c575
Given an undirected graph, a clique is a subset of vertices in which the induced subgraph is complete; that is, all pairs of vertices of this subset are adjacent. Clique problems in graphs are very important due to their numerous applications. One of these problems is the clique partitioning problem (CPP), which consists of dividing the set of vertices of a graph into the smallest number of cliques possible. The CPP is an NP-hard problem with many application fields (timetabling, manufacturing, scheduling, telecommunications, etc.). Despite its great applicability, few recent studies have focused on proposing specific resolution methods for the CPP. This article presents a resolution method that combines multistart strategies with tabu search. The most novel characteristic of our method is that it allows unfeasible solutions to be visited, which facilitates exploration of the solution space. The computational tests show that our method performs better than previous methods proposed for this problem. In fact, our method strictly improves the results of these methods in most of the instances considered while requiring less computation time.
eng
Atribución-NoComercial 4.0 Internacional
Clique partitioning problem
Metaheuristics
Tabu search
Multistart methods
Dataset of the paper “A stepped tabu search method for the clique partitioning problem”. Applied Intelligence, 53, 16275-16292
dataset
RWwgYXV0b3IgY29tbyDDum5pY28gdGl0dWxhciBkZSBsb3MgZGVyZWNob3MgZGUgcHJvcGllZGFkIGludGVsZWN0dWFsIGRlIGxhIG9icmEsIG8gZGlzcG9uaWVuZG8gZGUgbG9zIGRlYmlkb3MgcGVybWlzb3MgZGUgbG9zIG90cm9zIHRpdHVsYXJlcywgc2kgbG9zIGh1YmllcmEsIHkgZW4gdmlydHVkIGRlIGxvcyBkZXJlY2hvcyBxdWUgbGUgY29uZmllcmUgbGEgbGVnaXNsYWNpw7NuIHZpZ2VudGUgc29icmUgcHJvcGllZGFkIGludGVsZWN0dWFsIHkgZGVyZWNob3MgZGUgYXV0b3IsIA0KQVVUT1JJWkEgYSBsYSBVbml2ZXJzaWRhZCBkZSBCdXJnb3MgYSBkaWZ1bmRpciwgZGUgbWFuZXJhIGdyYXR1aXRhLCBlbCBjb250ZW5pZG8gZGUgbG9zIGFyY2hpdm9zIGRpZ2l0YWxlcyBxdWUgY29ycmVzcG9uZGVuIGFsIGRvY3VtZW50byBkZXNjcml0byBhbnRlcmlvcm1lbnRlLCBjb24gY2Fyw6FjdGVyIG5vIGV4Y2x1c2l2byB5IGRlIG1hbmVyYSBww7pibGljYSBlbiBhY2Nlc28gYWJpZXJ0byBhIHRyYXbDqXMgZGUgSW50ZXJuZXQsIHBhcmEgbG8gcXVlIGxhIEJpYmxpb3RlY2EgcHJvY2VkZXLDoSBhIGFyY2hpdmFybG9zIGVuIGVsIFJlcG9zaXRvcmlvIEluc3RpdHVjaW9uYWwuIEFzaW1pc21vIGF1dG9yaXphIGEgbGEgVW5pdmVyc2lkYWQgZGUgQnVyZ29zIGEgcmVhbGl6YXIgbGFzIHRyYW5zZm9ybWFjaW9uZXMgbmVjZXNhcmlhcyBkZSBmb3JtYXRvLCBubyBkZSBjb250ZW5pZG8sIHBhcmEgZ2FyYW50aXphciBsYSBwcmVzZXJ2YWNpw7NuIHkgZWwgYWNjZXNvIGVuIGVsIGZ1dHVyby4NCg0KRWwgYXV0b3IgZGlzcG9uZSwgZW4gdG9kbyBjYXNvLCBkZWwgZGVyZWNobyBhIHJldm9jYXIgZXN0YSBhdXRvcml6YWNpw7NuLg0KDQpMYSBjZXNpw7NuIGRlIGRlcmVjaG9zIGRlIGVzdGEgb2JyYSBzZSBlbmN1ZW50cmEgc3VqZXRhIGEgbGEgbGVnaXNsYWNpw7NuIHZpZ2VudGUgc29icmUgcHJvcGllZGFkIGludGVsZWN0dWFsIHkgZGVyZWNob3MgZGUgYXV0b3Iu
URL
https://riubu.ubu.es/bitstream/10259/9822/2/readme.docx
File
MD5
a82e806c16d91b625f2fcd3c27b4b57e
14176
application/vnd.openxmlformats-officedocument.wordprocessingml.document
readme.docx
URL
https://riubu.ubu.es/bitstream/10259/9822/1/Pacheco-solutions_in_dimacs_instances_for_cpp-2022.zip
File
MD5
46c257fd16e19c8f269160101de4ed9f
145652
application/zip
Pacheco-solutions_in_dimacs_instances_for_cpp-2022.zip