A hybrid heuristic for the maximum clique problem

DOI10.1007/s10732-006-3750-xzbMath1122.90070MaRDI QIDQ2491328

Alok Singh, Ashok Kumar Gupta

Publication date: 29 May 2006

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

Full work available at URL: https://doi.org/10.1007/s10732-006-3750-x

zbMATH Keywords

Combinatorial optimization; Greedy heuristic; Maximum clique; Steady-state genetic algorithm

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Simple ingredients leading to very efficient heuristics for the maximum clique problem

Uses Software

• QUALEX
• DIMACS
• Algorithm 787

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• Approximation algorithms for combinatorial problems
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• A genetic algorithm for the set covering problem
• A new trust region technique for the maximum weight clique problem
• A Complementary Pivoting Approach to the Maximum Weight Clique Problem
• Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Optimized Crossover for the Independent Set Problem
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Reactive local search for the maximum clique problem
• Adaptive, restart, randomized greedy heuristics for maximum clique