Another look at graph coloring via propositional satisfiability.
Allen Van GelderPublished in: Discret. Appl. Math. (2008)
Keyphrases
- graph coloring
- propositional satisfiability
- max sat
- sat solvers
- combinatorial problems
- constraint programming
- sat problem
- phase transition
- lower bound
- constraint satisfaction
- satisfiability problem
- branch and bound algorithm
- propositional logic
- constraint satisfaction problems
- tabu search
- search algorithm
- stochastic local search
- branch and bound
- automated reasoning
- symmetry breaking
- industrial applications
- orders of magnitude
- sat instances
- search strategies
- linear programming
- job shop scheduling
- genetic algorithm
- constraint propagation
- global constraints
- scheduling problem
- search tree
- randomly generated
- np complete
- information retrieval systems
- optimal solution