sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing.
Hui XuRob A. RutenbarKarem A. SakallahPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2003)
Keyphrases
- boolean satisfiability
- sat solvers
- sat problem
- branch and bound algorithm
- sat solving
- probabilistic planning
- randomly generated
- boolean optimization
- symmetry breaking
- integer linear programming
- optimal solution
- max sat
- combinatorial problems
- sat instances
- phase transition
- maximum satisfiability
- satisfiability problem
- orders of magnitude
- constraint programming
- boolean formula
- heuristic search
- unsatisfiable cores
- boolean functions
- branch and bound
- combinatorial optimization
- upper bound