Minimum decomposition into convex binary matrices
From MaRDI portal
Publication:423930
DOI10.1016/J.DAM.2012.01.013zbMATH Open1238.92020OpenAlexW2092346656MaRDI QIDQ423930FDOQ423930
Authors: Fethi Jarray, Christophe Picouleau 
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.013
Recommendations
- How to decompose a binary matrix into three \(hv\)-convex polyominoes
- Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy
- Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
- Decomposition of integer matrices and multileaf collimator sequencing
- Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
Medical applications (general) (92C50) Applications of graph theory (05C90) Special matrices (15B99)
Cites Work
- Optimizing the Delivery of Radiation Therapy to Cancer Patients
- Mathematical optimization in intensity modulated radiation therapy
- Reconstruction of L-convex Polyominoes
- The NP-Completeness of Edge-Coloring
- Beam selection in radiotherapy design
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- Decomposition of integer matrices and multileaf collimator sequencing
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- Inverse radiation therapy planning -- a multiple objective optimization approach
Cited In (2)
This page was built for publication: Minimum decomposition into convex binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423930)
