A branch and cut algorithm for MAX-SAT and weighted MAX-SAT.
Steve JoyJohn E. MitchellBrian BorchersPublished in: Satisfiability Problem: Theory and Applications (1996)
Keyphrases
- max sat
- weighted max sat
- maximum satisfiability
- dynamic programming
- cost function
- learning algorithm
- search space
- linear programming
- optimal solution
- computational complexity
- particle swarm optimization
- randomly generated
- objective function
- search algorithm
- data structure
- branch and bound
- search strategy
- sat solvers
- cnf formula
- graph coloring
- boolean satisfiability
- neural network