Decomposing Hard SAT Instances with Metaheuristic Optimization.
Daniil ChivilikhinArtem PavlenkoAlexander A. SemenovPublished in: CoRR (2023)
Keyphrases
- metaheuristic
- optimization problems
- combinatorial optimization
- sat instances
- harmony search
- tabu search
- hybrid algorithms
- search space
- ant colony optimization
- sat solvers
- scatter search
- evolutionary algorithm
- simulated annealing
- genetic algorithm
- vehicle routing problem
- combinatorial problems
- particle swarm optimization
- iterated local search
- search methods
- optimal solution
- satisfiability problem
- boolean satisfiability
- suboptimal solutions
- global optimization
- randomly generated
- sat problem
- neural network
- branch and bound
- traveling salesman problem
- optimization algorithm
- cost function
- objective function
- set of benchmark instances
- phase transition
- max sat
- hyper heuristics
- search algorithm