A Theoretical Framework of Hybrid Approaches to MAX SAT.
Takao AsanoKuniaki HoriTakao OnoTomio HirataPublished in: ISAAC (1997)
Keyphrases
- theoretical framework
- hybrid approaches
- max sat
- weighted max sat
- lower bound
- search algorithm
- sat solvers
- tabu search
- branch and bound
- branch and bound algorithm
- satisfiability problem
- theoretical foundation
- sat problem
- constraint satisfaction
- stochastic local search
- linear programming
- collaborative knowledge building
- maximum satisfiability
- max sat solver
- heuristic search
- cnf formula
- fundamental principles
- cost function
- search space
- random sat instances