Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization.
Jonas NüßleinSebastian ZielinskiThomas GaborClaudia Linnhoff-PopienSebastian FeldPublished in: ICCS (5) (2023)
Keyphrases
- max sat
- weighted max sat
- maximum satisfiability
- variable ordering
- quadratic program
- stochastic local search
- graph coloring
- combinatorial optimization
- branch and bound algorithm
- branch and bound
- lower bound
- sat problem
- search algorithm
- nonlinear programming
- satisfiability problem
- random sat instances
- sat solvers
- linear program
- sat instances
- linear programming
- tabu search
- optimization problems
- boolean satisfiability
- computational complexity
- objective function
- evolutionary algorithm
- constraint satisfaction
- multi objective
- information retrieval