A hybrid heuristic for the maximum clique problem

dc.contributor.author	Singh, Alok
dc.contributor.author	Gupta, Ashok Kumar
dc.date.accessioned	2022-03-27T06:08:34Z
dc.date.available	2022-03-27T06:08:34Z
dc.date.issued	2006-01-01
dc.description.abstract	In this paper we present a heuristic based steady-state genetic algorithm for the maximum clique problem. The steady-state genetic algorithm generates cliques, which are then extended into maximal cliques by the heuristic. We compare our algorithm with three best evolutionary approaches and the overall best approach, which is non-evolutionary, for the maximum clique problem and find that our algorithm outperforms all the three evolutionary approaches in terms of best and average clique sizes found on majority of DIMACS benchmark instances. However, the obtained results are much inferior to those obtained with the best approach for the maximum clique problem. © Springer Science + Business Media, Inc. 2006.
dc.identifier.citation	Journal of Heuristics. v.12(1-2)
dc.identifier.issn	13811231
dc.identifier.uri	10.1007/s10732-006-3750-x
dc.identifier.uri	http://link.springer.com/10.1007/s10732-006-3750-x
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9425
dc.subject	Combinatorial optimization
dc.subject	Greedy heuristic
dc.subject	Maximum clique
dc.subject	Steady-state genetic algorithm
dc.title	A hybrid heuristic for the maximum clique problem
dc.type	Journal. Article
dspace.entity.type

Now showing 1 - 1 of 1