A Multilevel Memetic Algorithm for Large SAT-Encoded Problems | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

A Multilevel Memetic Algorithm for Large SAT-Encoded Problems

Evolutionary Computation (2012) 20 (4): 641–664.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization—Part I

Mohammad Nabi Omidvar
Xiaodong Li
Xin Yao

IEEE Transactions on Evolutionary Computation (2022) 26 (5): 802.

A team of pursuit learning automata for solving deterministic optimization problems

Anis Yazidi
Nourredine Bouhmala
Morten Goodwin

Applied Intelligence (2020) 50 (9): 2916.

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT

Mourad Lassouaoui
Dalila Boughaci
Belaid Benhamou

Intelligent Decision Technologies (2019) 13 (2): 193.

Combining simulated annealing with local search heuristic for MAX-SAT

Noureddine Bouhmala

Journal of Heuristics (2019) 25 (1): 47.

A multilevel learning automata for MAX-SAT

Noureddine Bouhmala

International Journal of Machine Learning and Cybernetics (2015) 6 (6): 911.

A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems

Noureddine Bouhmala

The Scientific World Journal (2014) 2014: 1.