Relaxation in graph coloring and satisfiability problems
Pontus SvensonMats G. NordahlPublished in: CoRR (1998)
Keyphrases
- graph coloring
- satisfiability problem
- phase transition
- max sat
- combinatorial problems
- sat problem
- np complete
- constraint satisfaction
- search algorithm
- stochastic local search
- randomly generated
- sat instances
- temporal logic
- job shop scheduling
- cellular automata
- objective function
- davis putnam
- heuristic search
- particle swarm optimization
- multi agent systems
- search procedures