ISSN:
1572-9338
Keywords:
Maximum clique
;
tabu search
;
probabilistic tabu
;
random graph generator
;
approximate methods
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the $$\hat p$$ -generator, which produces graphs with larger clique sizes than comparable ones obtained by classical random graph generating techniques. Computational results on a large set of test problems randomly generated with this new generator are reported and compared with those of other approximate methods.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02023002
Permalink
