Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Diversification strategies in tabu search algorithms for the maximum clique problem (1996)
    Springer
    Annals of operations research 63 (1996), S. 189-207 
    Details
    ISSN: 1572-9338
    Keywords: Tabu search ; diversification ; maximum clique ; combinatorial optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The purpose of this study is to develop some understanding of the benefits that can be derived from the inclusion of diversification strategies in tabu search methods. To do so, we discuss the implementation of various diversification strategies in several tabu search heuristics developed for the maximum clique problem. Computational results on a large set of randomly generated test problems are reported and compared to assess the impact of these techniques on solution quality and running time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02125454
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Solving the maximum clique problem using a tabu search approach (1993)
    Springer
    Annals of operations research 41 (1993), S. 385-403 
    Details
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...