Maximum submatrix problem

Given a M by N matrix of integers. Find the maximum sum of a submatix of the given one. Submatrix is any rectangle which is in our matrix. for example: -3 1 1 4 the max sum is 5 This problem can be solved in efficient way using DP