Dynamic programming algorithm for the non-contiguous 2d max sum subarray problem

Question

The 2d max sum subarray (non-contiguous version) can be stated as:

Given a matrix a(i,j), find a subset of rows and columns such that the sum of the elem