algorithm - Minimum makespan for matrix -
given ab, matrix required partition mn blocks in such way maximum of sum of elements in each block minimized.
a matrix = [aij] of nonnegative integers must partitioned p blocks (submatrices) corresponding set of vertical cuts parallel columns , set of horizontal cuts parallel rows. each block associated cost equal sum of elements. problem finding matrix partitioning minimizes cost of block of maximum cost.
how can implement this?
Comments
Post a Comment