Adaptive, restart, randomized greedy heuristics for maximum clique

DOI10.1023/A:1011925109392zbMath0987.68612MaRDI QIDQ5960736

Laura A. Sanchis, Arun K. Jagota

Publication date: 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

heuristics; adaptation; maximum clique; test cases

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Mining relevant information on the Web: a clique-based approach, Simple ingredients leading to very efficient heuristics for the maximum clique problem, A hybrid heuristic for the maximum clique problem, A study of ACO capabilities for solving the maximum clique problem