Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
From MaRDI portal
Recommendations
- Solving the SAT problem based on evolutionary algorithm
- Hybrid evolutionary algorithm for solving optimization problems
- An improved differential evolution algorithm for solving constraint optimization problem
- Hybrid evolutionary algorithm for solving general variational inequality problems
- Evolutionary computing for the satisfiability problem
Cited in
(11)- An artificial bee colony algorithm for solving SAT problem
- Solving SAT problems by orthogonal method
- Solving the SAT problem based on evolutionary algorithm
- Boosting SAT solver performance via a new hybrid approach
- Evolutionary computing for the satisfiability problem
- Convergence properties of optimization algorithms for the SAT problem
- ERA: An algorithm for reducing the epistasis of SAT problems
- A genetic-based approach for satisfiability problems
- Parallel genetic algorithm for SAT problems based on OpenMP
- Recombination operators for satisfiability problems
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
This page was built for publication: Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399958)