Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 798323, 11 pages
Research Article

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

Department of Maritime Technology and Innovation, Buskerud and Vestfold University, Norway

Received 23 April 2014; Accepted 10 June 2014; Published 6 August 2014

Academic Editor: Su Fong Chien

Copyright © 2014 Noureddine Bouhmala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [5 citations]

The following is the list of published articles that have cited the current article.

  • Adil Baykasoğlu, and Fehmi Burcin Ozsoydan, “An improved approach for determination of index positions on CNC magazines with cutting tool duplications by integrating shortest path algorithm,” International Journal of Production Research, pp. 1–19, 2015. View at Publisher · View at Google Scholar
  • N. Bouhmala, M. Oseland, and Ø. Brådland, “WalkSAT Based-Learning Automata for MAX-SAT,” Recent Advances in Soft Computing, vol. 576, pp. 98–110, 2017. View at Publisher · View at Google Scholar
  • Youcef Djenouri, Zineb Habbas, Djamel Djenouri, and Philippe Fournier-Viger, “Bee swarm optimization for solving the MAXSAT problem using prior knowledge,” Soft Computing, 2017. View at Publisher · View at Google Scholar
  • Noureddine Bouhmala, “Combining simulated annealing with local search heuristic for MAX-SAT,” Journal of Heuristics, 2018. View at Publisher · View at Google Scholar
  • Mourad Lassouaoui, Dalila Boughaci, and Belaid Benhamou, “A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT,” Intelligent Decision Technologies, pp. 1–18, 2019. View at Publisher · View at Google Scholar