Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization.
Jonas NüßleinSebastian ZielinskiThomas GaborClaudia Linnhoff-PopienSebastian FeldPublished in: CoRR (2023)
Keyphrases
- max sat
- weighted max sat
- maximum satisfiability
- graph coloring
- variable ordering
- quadratic program
- stochastic local search
- nonlinear programming
- combinatorial optimization
- branch and bound algorithm
- lower bound
- tabu search
- sat solvers
- branch and bound
- linear programming
- sat problem
- random sat instances
- satisfiability problem
- search algorithm
- special case
- traveling salesman problem
- decision problems
- constraint satisfaction
- boolean formula
- simulated annealing
- search space
- unsatisfiable cores
- max sat solver