Quantum hybrid algorithm for solving SAT problem.
Charles Moudina VarmantchaonalaJean Louis Ebongue Kedieng FendjiJean Pierre Tchapet NjafaMarcellin AtemkengPublished in: Eng. Appl. Artif. Intell. (2023)
Keyphrases
- hybrid algorithm
- hybrid algorithms
- sat problem
- sat instances
- np complete problems
- weighted max sat
- particle swarm optimization
- random sat instances
- satisfiability problem
- sat solving
- simulated annealing
- tabu search
- stochastic local search
- sat solvers
- max sat
- differential evolution
- np complete
- particle swarm optimization pso
- randomly generated
- genetic algorithm
- hybrid optimization algorithm
- ant colony optimization
- phase transition
- standard test problems
- constraint satisfaction problems
- boolean satisfiability
- artificial bee colony algorithm
- decision problems
- evolutionary algorithm
- imperialist competitive algorithm
- propositional satisfiability
- branch and bound
- combinatorial optimization
- optimization method
- optimal solution
- boolean formula
- global optimization
- random sat
- heuristic search
- metaheuristic
- optimization algorithm