The Scientific World Journal / 2014 / Article / Alg 1

Research Article

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

Algorithm 1

Walksat algorithm.
input: Problem in CNF format
output: Number of satisfied clauses
(1)begin
(2)  for    to  MAX-TRIES  do
(3)   T Random-Assignment();
(4)   for    to  MAX-FLIPS  do
(5)      Random-Unsatisfied-Clause();
(6)     if  (variable   with breakcount = 0)  then Chosen-Variable ;
(7)     else  if  (random(0,1) )  then
(8)     Chosen-Variable Random-Variable;
(9)     else
(10)      Chosen-Variable Random-Lowest-Break count;
(11)    end
(12)  end
(13) end
(14)  end

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.