Decomposition of integer matrices and multileaf collimator sequencing
- 1 November 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 152 (1-3), 6-34
- https://doi.org/10.1016/j.dam.2005.04.008
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapyNetworks, 2004
- Set covering with almost consecutive ones propertyDiscrete Optimization, 2004
- Minimizing beam‐on time in cancer radiation treatment using multileaf collimatorsNetworks, 2004
- Inverse radiation therapy planning — a multiple objective optimization approachDiscrete Applied Mathematics, 2002
- Locating New Stops in a Railway Network1 1This work was partially supported by the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE).Electronic Notes in Theoretical Computer Science, 2001
- Minimizing static intensity modulation delivery time using an intensity solid paradigmInternational Journal of Radiation Oncology*Biology*Physics, 1999
- Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segmentsMedical Physics, 1998
- X-ray field compensation with multileaf collimatorsInternational Journal of Radiation Oncology*Biology*Physics, 1994
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976