Minimum decomposition into convex binary matrices
From MaRDI portal
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
Cites work
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy
- Beam selection in radiotherapy design
- Decomposition of integer matrices and multileaf collimator sequencing
- Inverse radiation therapy planning -- a multiple objective optimization approach
- Mathematical optimization in intensity modulated radiation therapy
- Minimizing beam-on time in cancer radiation treatment using multileaf collimators
- Optimizing the Delivery of Radiation Therapy to Cancer Patients
- Reconstruction of L-convex Polyominoes
- The NP-Completeness of Edge-Coloring
Cited in
(5)- On explaining integer vectors by few homogenous segments
- A dual of the rectangle-segmentation problem for binary matrices
- How to decompose a binary matrix into three \(hv\)-convex polyominoes
- Optimal decompositions of matrices with grades into binary and graded matrices
- Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning
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)
