Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability
Charles Fleurent, Jacques A. Ferland · DIMACS series in discrete mathematics and theoretical computer science · 1996
Using object-oriented design and the C++ programming language, generic operators are developed for tabu search and genetic algorithms. These operators are used for the graph coloring, maximum clique and satisfiability problems. The availability of all methods for each problem permits to consider hybrid schemes.