TY  - RPRT 
AU  - Pacheco Bonrostro, Joaquín
AU  - Casado Yusta, Silvia
PY  - 2022
UR  - http://hdl.handle.net/10259/9822
AB  - 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...
LA  - eng
A3  - Universidad de Burgos
KW  - Clique partitioning problem
KW  - Metaheuristics
KW  - Tabu search
KW  - Multistart methods
KW  - Investigación operativa
KW  - Operations research
KW  - Modelos matemáticos
KW  - Mathematical models
TI  - Dataset of the paper “A stepped tabu search method for the clique partitioning problem”. Applied Intelligence, 53, 16275-16292
DO  - 10.36443/10259/9822
ER  -