Optimal matrix-segmentation by rectangles

DOI10.1016/j.dam.2008.12.008zbMath1173.05012MaRDI QIDQ5902115

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 programming; network flow; segmentation algorithm; rectangular partition; intensity-modulated radiation therapy (IMRT); revised simplex method; gomory cut; matrix-decomposition

Mathematics Subject Classification ID

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

Related Items

Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

Cites Work

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