On the usefulness of linkage processing for solving MAX-SAT.
Krzysztof L. SadowskiPeter A. N. BosmanDirk ThierensPublished in: GECCO (2013)
Keyphrases
- max sat
- weighted max sat
- stochastic local search
- variable ordering
- graph coloring
- tabu search
- sat solvers
- sat problem
- lower bound
- search algorithm
- branch and bound algorithm
- satisfiability problem
- random sat instances
- branch and bound
- constraint satisfaction
- particle swarm optimization
- maximum satisfiability
- integer programming
- randomly generated
- combinatorial optimization
- orders of magnitude
- boolean formula
- linear programming
- upper bound
- unsatisfiable cores
- np hard