minimization of maximized non-overlapping numbers from matrix

Question

I am looking for an efficient solution which select non overlapping value from a matrix irrespective of minimization of cost. Hungarian algorithm solved the assignment problem b