Optimal matrix-segmentation by rectangles

Authors:
Konrad Engel
Affiliations:
Institut für Mathematik, Universität Rostock, Universitätsplatz 1, D-18051 Rostock, Germany
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 8
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles

Discrete & Computational Geometry
Sperner theory

Sperner theory
Minimizing beam-on time in cancer radiation treatment using multileaf collimators

Networks
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

Networks
Decomposition of integer matrices and multileaf collimator sequencing

Discrete Applied Mathematics
A new algorithm for optimal multileaf collimator field segmentation

Discrete Applied Mathematics
Realization of intensity modulated radiation fields using multileaf collimators

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study the problem of decomposing a nonnegative matrix into a nonnegative combination of 0-1-matrices whose ones form a rectangle such that the sum of the coefficients is minimal. We present for the case of two rows an easy algorithm that provides an optimal solution which is integral if the given matrix is integral. An additional integrality constraint makes the problem more difficult if the matrix has more than two rows. An algorithm that is based on the revised simplex method and uses only very few Gomory cuts yields exact integral solutions for integral matrices of reasonable size in a short time. For matrices of large dimension we propose a special greedy algorithm that provides sufficiently good results in numerical experiments.