Grenade explosion method for maximum weight clique problem

dc.contributor.author	Pallantla, Manohar
dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T05:59:59Z
dc.date.available	2022-03-27T05:59:59Z
dc.date.issued	2012-11-07
dc.description.abstract	Maximum weight clique problem is an NP-Hard problem which seeks the fully connected subgraph of maximum weight in a given vertex weighted graph G. In this paper, we have used a recently proposed metaheuristic technique called Grenade Explosion Method (GEM) to solve the maximum weight clique problem. GEM was originally designed for continuous optimization problems. We have suitably modified the GEM so that it can be applied to a discrete optimization problem. To our knowledge this is the first approach which uses GEM for the discrete optimization. Computational results on the benchmark instances show the effectiveness of our proposed GEM approach. © 2012 Springer-Verlag.
dc.identifier.citation	Communications in Computer and Information Science. v.306 CCIS
dc.identifier.issn	18650929
dc.identifier.uri	10.1007/978-3-642-32129-0_8
dc.identifier.uri	http://link.springer.com/10.1007/978-3-642-32129-0_8
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9059
dc.subject	Combinatorial Optimization
dc.subject	Grenade Explosion Method
dc.subject	Heuristic
dc.subject	Maximum Weight Clique Problem
dc.title	Grenade explosion method for maximum weight clique problem
dc.type	Book Series. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1