Partitioning a matrix to minimize the maximum cost

DOI10.1016/0166-218X(94)00154-6zbMath0833.90086MaRDI QIDQ1900148

Massimo Spadoni, Salvatore Ricciardelli, Aristide Mingozzi

Publication date: 18 March 1996

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

zbMATH Keywords

matrix partitioningtree search algorithmexact and heuristic algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (5)

Approximations for the general block distribution of a matrix ⋮ Partitioning a matrix with non-guillotine cuts to minimize the maximum cost ⋮ Approximations for the general block distribution of a matrix ⋮ On a 2-dimensional equipartition problem ⋮ Path equipartition in the Chebyshev norm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of a shifting algorithm
• Most uniform path partitioning and its use in image processing
• Max-Min Tree Partitioning
• An Algorithm for Grey-Level Transformations in Digitized Images

This page was built for publication: Partitioning a matrix to minimize the maximum cost