A stepped tabu search method for the clique partitioning problem

Article Computer Science, Artificial Intelligence

CIM: clique-based heuristic for finding influential nodes in multilayer networks

K. Venkatakrishna Rao et al.

Summary: The study focuses on identifying influential nodes in multilayer networks for efficient information spreading, proposing a novel clique-based influence maximization algorithm. Results show that the influence spread in multilayer networks is better with the proposed algorithm compared to others, demonstrating its effectiveness in detecting influential nodes.

APPLIED INTELLIGENCE (2022)

Add to Collection

Article Automation & Control Systems

A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem

Zhi Lu et al.

Summary: A new evolutionary algorithm that combines dedicated crossover operator and simulated annealing approach shows remarkable performance in solving clique partitioning problem. The algorithm's key ingredients have been analyzed to understand their impact on performance.

IEEE TRANSACTIONS ON CYBERNETICS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A novel two-model local search algorithm with a self-adaptive parameter for clique partitioning problem

Shuli Hu et al.

Summary: This paper proposes a novel two-model local search algorithm (TMLS_SA) to solve the clique partitioning problem (CPP), which initializes with a simple solution and improves it through a two-model local search incorporating gain function, lock mechanism, and perturbation process. Experimental results show that TMLS_SA outperforms competitors in solution quality on almost all test instances.

NEURAL COMPUTING & APPLICATIONS (2021)

Add to Collection

Article Management