Decomposition of integer matrices and multileaf collimator sequencing
A binary matrix is a (strict) \textit{consecutive ones matrix} if the ones occur consecutively in a single block in each row. Let \({\mathcal K}\) be an index set of all \(M\times N\) consecutive ones matrices and \({\mathcal K'}\subset {\mathcal K}\). The authors deal with the following problem. Given an \(M\times N\) matrix \(A=(a_{m,n})\) with nonnegative integer entries, find nonnegative integers \(\alpha_k\) and \(M\times N\) consecutive ones matrices \(Y^k\), where \(k\in {\mathcal K'}\), such that \(A=\sum_{k\in{\mathcal K'}} \alpha_kY^k.\) They are particularly interested in minimizing the sum of the coefficients in the decomposition and minimizing the number of matrices used in the decomposition. They develop several algorithms for achieving their goal in polynomial time under certain assumptions. There are applications to radiation therapy planning and stop design in public transportation.
- 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
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
- Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder
- Discrete approximations to real-valued leaf sequencing problems in radiation therapy
- The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
- An integer linear programming formulation for the minimum cardinality segmentation problem
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
- Minimizing the number of apertures in multileaf collimator sequencing with field splitting
- A note on improving the performance of approximation algorithms for radiation therapy
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- On explaining integer vectors by few homogeneous segments
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
- Iterative variable aggregation and disaggregation in IP: an application
- Quantifying the trade-off between IMRT treatment plan quality and delivery efficiency using direct aperture optimization
- 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
- Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
- A minimum cost flow formulation for approximated MLC segmentation
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY
- Hybrid methods for the multileaf collimator sequencing problem
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
- A closest vector problem arising in radiation therapy planning
- A function approximation approach to the segmentation step in IMRT planning
- Minimum decomposition into convex binary matrices
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- How to decompose a binary matrix into three hv-convex polyominoes
- Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning
- Shape rectangularization problems in intensity-modulated radiation therapy
- CP and IP approaches to cancer radiotherapy delivery optimization
- Mathematical optimization in intensity modulated radiation therapy
- Optimal matrix-segmentation by rectangles
- Mathematical optimization in intensity modulated radiation therapy
- Approximated matrix decomposition for IMRT planning with multileaf collimators
- 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
- A shortest path-based approach to the multileaf collimator sequencing problem
- Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators
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)
