Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
Nuno P. LopesLevent AksoyVasco M. ManquinhoJosé MonteiroPublished in: CoRR (2010)
Keyphrases
- boolean optimization
- boolean satisfiability
- sat solving
- sat solvers
- random sat instances
- branch and bound algorithm
- randomly generated
- probabilistic planning
- sat problem
- integer linear programming
- maximum satisfiability
- symmetry breaking
- sat instances
- boolean formula
- nonlinear programming
- max sat
- random sat
- genetic algorithm
- stochastic local search
- search tree
- satisfiability problem
- constraint satisfaction
- heuristic search
- optimization problems
- lower bound
- search algorithm