sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing.
Hui XuRob A. RutenbarKarem A. SakallahPublished in: ISPD (2002)
Keyphrases
- boolean satisfiability
- sat solvers
- sat problem
- branch and bound algorithm
- boolean optimization
- probabilistic planning
- randomly generated
- sat solving
- symmetry breaking
- maximum satisfiability
- integer linear programming
- max sat
- sat instances
- orders of magnitude
- optimal solution
- combinatorial problems
- phase transition
- satisfiability problem
- constraint programming
- boolean formula
- np complete