Decomposition of integer matrices and multileaf collimator sequencing

DOI10.1016/J.DAM.2005.04.008MaRDI QIDQ2576339zbMATH OpenOpenAlexFDO

Authors Davaatseren Baatar, Horst W. Hamacher, Matthias Ehrgott, Gerhard J. Woeginger

Publication date 27 December 2005

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

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

zbMATH Keywords

algorithmsradiotherapyconsecutive ones propertydecomposition of integer matricesmultileaf collimator sequencingstop design in public transportation

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Integer programming (90C10) Positive matrices and their generalizations; cones of matrices (15B48) Matrices of integers (15B36) Transportation, logistics and supply chain management (90B06)

Recommendations

• Decomposition of matrix sequences
• Algorithms for sequencing multileaf collimators
• Matrix decompositions
• Hybrid methods for the multileaf collimator sequencing problem
• scientific article; zbMATH DE number 4201470
• Integration of combinatorial decompositions in the presence of collinearities
• Part III Matrix decomposition methods for parallel computers
• On the mathematics of sequential decompositions
• Partial fraction decomposition of matrices and parallel computing

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• Inverse radiation therapy planning -- a multiple objective optimization approach
• Minimizing beam-on time in cancer radiation treatment using multileaf collimators
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(36)

• Mathematical optimization in intensity modulated radiation therapy
• Shape rectangularization problems in intensity-modulated radiation therapy
• The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
• A closest vector problem arising in radiation therapy planning
• Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
• A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators
• An integer linear programming formulation for the minimum cardinality segmentation problem
• A minimum cost flow formulation for approximated MLC segmentation
• Minimum decomposition into convex binary matrices
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
• How to decompose a binary matrix into three \(hv\)-convex polyominoes
• Discrete approximations to real-valued leaf sequencing problems in radiation therapy
• A function approximation approach to the segmentation step in IMRT planning
• A note on improving the performance of approximation algorithms for radiation therapy
• A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
• Quantifying the trade-off between IMRT treatment plan quality and delivery efficiency using direct aperture optimization
• Iterative variable aggregation and disaggregation in IP: an application
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
• A shortest path-based approach to the multileaf collimator sequencing problem
• Mathematical optimization in intensity modulated radiation therapy
• Approximated matrix decomposition for IMRT planning with multileaf collimators
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
• CP and IP approaches to cancer radiotherapy delivery optimization
• Optimal matrix-segmentation by rectangles
• MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY
• Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
• Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
• Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder
• Minimizing the number of apertures in multileaf collimator sequencing with field splitting
• The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
• Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning
• On explaining integer vectors by few homogeneous segments
• Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
• Hybrid methods for the multileaf collimator sequencing problem
• Column-coherent matrix decomposition
• Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes

This page was built for publication: Decomposition of integer matrices and multileaf collimator sequencing

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