Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach

Guillaume Derval, Pierre Schaus

Abstract: Highlights•The Maximum-Sum Submatrix problem aims at finding submatrices of maximum sum.•Two upper bounds are proposed for the problem, both based on linear relaxations.•A reduced-cost filtering algorithm is proposed for constraint programming solvers.•Large instances are tackled using Large Neighborhood Search.•Improved performance of CP on synthetic and real-word instances against MIP solvers.