algorithm - Minimum makespan for matrix -


given ab, matrix required partition mn blocks in such way maximum of sum of elements in each block minimized.

https://www.researchgate.net/publication/220570172_partitioning_a_matrix_to_minimize_the_maximum_cost

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

Popular posts from this blog

java - Jasper subreport showing only one entry from the JSON data source when embedded in the Title band -

serialization - Convert Any type in scala to Array[Byte] and back -

SonarQube Plugin for Jenkins does not find SonarQube Scanner executable -