TY  - JOUR 
AU  - Pacheco Bonrostro, Joaquín
AU  - Casado Yusta, Silvia
PY  - 2022
SN  - 0924-669X
UR  - http://hdl.handle.net/10259/7402
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
PB  - Springer Nature
KW  - Clique partitioning problem
KW  - Metaheuristics
KW  - Tabu search
KW  - Multistart methods
KW  - Economía
KW  - Economy
TI  - A stepped tabu search method for the clique partitioning problem
DO  - 10.1007/s10489-022-04304-7
T2  - Applied Intelligence
ER  -