Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems.
Benjamin W. WahZhe WuPublished in: J. Comput. Sci. Technol. (2005)
Keyphrases
- solving hard
- satisfiability problem
- combinatorial problems
- search problems
- np complete
- sat problem
- stochastic local search
- search algorithm
- temporal logic
- propositional logic
- phase transition
- propositional satisfiability
- objective function
- search procedures
- davis putnam
- sat instances
- search strategies
- constraint programming
- orders of magnitude
- max sat
- traveling salesman problem
- constraint satisfaction problems
- linear programming