Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability.
Charles FleurentJacques A. FerlandPublished in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
- search methods
- graph coloring
- search algorithm
- beam search
- search strategies
- metaheuristic
- combinatorial problems
- phase transition
- satisfiability problem
- maximum clique
- hyper heuristics
- max sat
- search procedures
- constraint satisfaction
- combinatorial optimization
- search heuristics
- tabu search
- job shop scheduling
- np complete
- simulated annealing
- dynamic programming
- relational databases
- search space
- sat problem
- genetic algorithm
- optimal solution
- bin packing
- packing problem
- np hard
- optimization problems
- ant colony optimization