Exact and heuristic algorithms for the maximum weighted submatrix coverage problem

•Exact and heuristic solution algorithms for a recently introduced hard large-scale problem.•We prove that the bound obtained by a previous exact approach is trivial.•We propose a reformulation based on Benders decomposition.•We show that the Benders cuts have a combinatorial structure.•We find improved solutions for over 700 instances from literature.