Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems
Authors:
- 1 July 1998
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 4 (2) , 107-122
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Optimized Crossover for the Independent Set ProblemOperations Research, 1997
- Edge projection and the maximum cardinality stable set problem1996
- Finding large cliques in arbitrary graphs by bipartite matching1996
- Camouflaging independent sets in quasi-random graphs1996
- Cliques, Coloring, and Satisfiability1996
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloringAlgorithmica, 1996
- Solving the maximum clique problem using a tabu search approachAnnals of Operations Research, 1993
- Test case generators and computational results for the maximum clique problemJournal of Global Optimization, 1993
- Keller’s cube-tiling conjecture is false in high dimensionsBulletin of the American Mathematical Society, 1992