Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper).
Neng-Fa ZhouPublished in: CP (2024)
Keyphrases
- hamiltonian cycle
- sat encodings
- graph coloring
- traveling salesman problem
- phase transition
- combinatorial problems
- sat solvers
- job shop scheduling
- combinatorial optimization
- constraint satisfaction problems
- hyper heuristics
- max sat
- upper bound
- randomly generated
- optimal solution
- optimization problems
- lower bound
- evolutionary algorithm
- planning domains
- machine learning
- metaheuristic
- linear programming