Optimal matrix-segmentation by rectangles

DOI10.1016/J.DAM.2008.12.008MaRDI QIDQ5902115zbMATH OpenOpenAlexFDO

Authors Konrad Engel

Publication date 24 June 2009

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

Full work available at URL https://doi.org/10.1016/j.dam.2008.12.008

zbMATH Keywords

linear programmingnetwork flowrectangular partitionintensity-modulated radiation therapy (IMRT)segmentation algorithmrevised simplex methodmatrix-decompositiongomory cut

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• A dual of the rectangle-segmentation problem for binary matrices
• Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
• Partitioning a matrix to minimize the maximum cost
• Optimal rectangular partitions
• Decomposition of integer matrices and multileaf collimator sequencing

Cites work

• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• A new algorithm for optimal multileaf collimator field segmentation
• Decomposition of integer matrices and multileaf collimator sequencing
• Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Minimal rectangular partitions of digitized blobs
• Minimizing beam-on time in cancer radiation treatment using multileaf collimators
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators

Cited in

(8)

• scientific article; zbMATH DE number 11347 (Why is no real title available?)
• A dual of the rectangle-segmentation problem for binary matrices
• On parsimonious explanations for 2-D tree- and linearly-ordered data
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
• Critical rows of almost-factorable matrices
• Orthogonal dissection into few rectangles
• Column-coherent matrix decomposition
• Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

This page was built for publication: Optimal matrix-segmentation by rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902115)