An efficient local search heuristic with row weighting for the unicost set covering problem.

•A new algorithm was developed for the unicost set covering problem.•It integrates ideas of adaptive row weighting, a tabu list, and timestamps.•It was evaluated on 91 benchmark problems with up to millions of variables.•It improved the best known solutions on 14 problems.