The Scientific World Journal / 2014 / Article / Alg 2

Research Article

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

Algorithm 2

input: Problem in CNF Format
output: Number of unsatisfied clauses
(1)/* Determine the set of neighborhood structures    = 1, 2,…, /*;
(2) 0;
(3)while  (Not reached the desired set of neighborhood)  do
(4)  Construct;
(5) ;
(6)Generate a random solution from neighborhood;
(8)while  do
(9)  Apply Walksat with as input solution;
(10)     Project();
(11)  ;
(12) Apply Walksat with () as input solution;
(13) return ();

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.