Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

DOI10.1016/S0166-218X(00)00286-9zbMath0993.68001MaRDI QIDQ5957361

Aristide Mingozzi, Serena Morigi

Publication date: 29 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound techniquesmatrix partitioning

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Mathematical problems of computer architecture (68M07)

Related Items (1)

Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

Uses Software

• Bisect

Cites Work

• Unnamed Item
• A load balancing package on distributed memory systems and its application to particle-particle particle-mesh (P3M) methods
• Partitioning a matrix to minimize the maximum cost
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Max-min partitioning of grid graphs into connected components
• Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

This page was built for publication: Partitioning a matrix with non-guillotine cuts to minimize the maximum cost