Reactive and dynamic local search for max-clique: engineering effective building blocks

DOI10.1016/J.COR.2009.02.013zbMath1173.90586OpenAlexW2023932999MaRDI QIDQ1038292

Roberto Battiti, Franco Mascia

Publication date: 17 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.013

zbMATH Keywords

reactive local searchstochastic local searchhybrid metaheuristicsalgorithm engineeringdynamic local search

Mathematics Subject Classification ID

Stochastic programming (90C15) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A review on algorithms for maximum clique problems ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Multi-neighborhood tabu search for the maximum weight clique problem ⋮ An analysis of parameter adaptation in reactive tabu search

Uses Software

• NetworkX
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Reactive search and intelligent optimization
• The maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• Emergence of Scaling in Random Networks
• The Reactive Tabu Search
• Reactive local search for the maximum clique problem

This page was built for publication: Reactive and dynamic local search for max-clique: engineering effective building blocks