International Scholarly Research Notices

Research Article

A New Formulation of the Set Covering Problem for Metaheuristic Approaches

Algorithm 1

DH().
sol empty solution;
loop
   find the set with the maximum ratio ;
    if ( ) then
     flip bit ;
    else
     stop;
    end if
end loop