-SAT and hamiltonian cycles.
Jonas NüßleinThomas GaborClaudia Linnhoff-PopienSebastian FeldPublished in: GECCO Companion (2022)
Keyphrases
- graph coloring
- sat solvers
- satisfiability problem
- sat problem
- np complete problems
- max sat
- sat encodings
- phase transition
- boolean satisfiability
- propositional satisfiability
- search algorithm
- stochastic local search algorithms
- sat solving
- job shop scheduling
- stochastic local search
- combinatorial problems
- sat instances
- np complete
- data sets
- backtracking search
- variable ordering
- search strategies
- simulated annealing
- computational complexity
- learning algorithm