Real-like MAX-SAT instances and the landscape structure across the phase transition.
Francisco ChicanoGabriela OchoaMarco TomassiniPublished in: GECCO (2021)
Keyphrases
- phase transition
- max sat
- sat problem
- satisfiability problem
- stochastic local search
- random sat
- randomly generated
- random instances
- maximum satisfiability
- constraint satisfaction
- graph coloring
- np complete problems
- sat instances
- combinatorial problems
- weighted max sat
- random sat instances
- np complete
- boolean satisfiability
- constraint satisfaction problems
- propositional satisfiability
- lower bound
- sat solvers
- branch and bound algorithm
- max sat solver
- random constraint satisfaction problems
- data structure
- hard problems
- integer programming
- linear programming
- davis putnam
- cellular automata
- optimization problems
- genetic algorithm