Iterative Stepped Search algorithm for the clique partitioning problem

Solana Ezquerra, Mario; Pacheco Bonrostro, Joaquín; Casado Yusta, Silvia

doi:10.71486/jdhk-b539

Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/10259/11496

Título

Iterative Stepped Search algorithm for the clique partitioning problem

Autor

Solana Ezquerra, Mario

Pacheco Bonrostro, Joaquín

Casado Yusta, Silvia

Editorial

Universidad de Burgos

Fecha de publicación

2026-03-21

DOI

10.71486/jdhk-b539

Resumo

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" 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.

Palabras clave

Graph problems

Cliques problems

Heuristic optimization

Iterated local search

Tabu search

Materia

Algoritmos

Algorithms

Teoría de grafos

Graph theory

URI