Using Genetic Programming to Approximate Maximum Clique
The MIT Press eBooks · 1996
We have attempted to solve the Maximum Clique Problem using a simple genetic program. The program language consists of a Union operator and vertex numbers. Our results compare favorably with complex genetic algorithms. We hypothesize that our use of genetic programming is particularly effective at exploiting the mechanism embodied by the Building Block Hypothesis.